/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:10:25,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:10:25,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:10:25,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:10:25,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:10:25,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:10:25,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:10:25,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:10:25,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:10:25,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:10:25,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:10:25,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:10:25,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:10:25,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:10:25,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:10:25,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:10:25,282 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:10:25,283 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:10:25,285 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:10:25,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:10:25,289 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:10:25,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:10:25,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:10:25,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:10:25,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:10:25,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:10:25,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:10:25,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:10:25,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:10:25,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:10:25,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:10:25,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:10:25,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:10:25,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:10:25,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:10:25,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:10:25,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:10:25,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:10:25,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:10:25,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:10:25,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:10:25,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:10:25,347 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:10:25,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:10:25,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:10:25,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:10:25,351 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:10:25,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:10:25,351 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:10:25,352 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:10:25,352 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:10:25,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:10:25,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:10:25,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:10:25,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:10:25,353 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:10:25,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:10:25,354 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:10:25,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:10:25,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:10:25,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:10:25,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:10:25,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:10:25,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:10:25,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:10:25,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:10:25,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:10:25,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:10:25,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:10:25,357 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:10:25,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:10:25,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:10:25,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:10:25,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:10:25,696 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:10:25,697 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:10:25,699 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2020-10-16 12:10:25,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/663127a7c/1abaa47b97ac4f15b03947cb0e5c81b6/FLAG2e2c5581d [2020-10-16 12:10:26,342 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:10:26,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2020-10-16 12:10:26,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/663127a7c/1abaa47b97ac4f15b03947cb0e5c81b6/FLAG2e2c5581d [2020-10-16 12:10:26,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/663127a7c/1abaa47b97ac4f15b03947cb0e5c81b6 [2020-10-16 12:10:26,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:10:26,588 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:10:26,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:10:26,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:10:26,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:10:26,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:10:26" (1/1) ... [2020-10-16 12:10:26,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571cca8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:26, skipping insertion in model container [2020-10-16 12:10:26,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:10:26" (1/1) ... [2020-10-16 12:10:26,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:10:26,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:10:27,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:10:27,244 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:10:27,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:10:27,423 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:10:27,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27 WrapperNode [2020-10-16 12:10:27,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:10:27,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:10:27,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:10:27,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:10:27,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:10:27,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:10:27,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:10:27,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:10:27,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... [2020-10-16 12:10:27,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:10:27,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:10:27,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:10:27,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:10:27,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:10:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:10:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:10:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:10:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:10:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:10:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:10:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:10:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:10:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:10:27,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:10:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:10:27,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:10:27,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:10:27,660 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:10:31,320 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:10:31,320 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:10:31,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:10:31 BoogieIcfgContainer [2020-10-16 12:10:31,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:10:31,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:10:31,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:10:31,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:10:31,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:10:26" (1/3) ... [2020-10-16 12:10:31,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e57963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:10:31, skipping insertion in model container [2020-10-16 12:10:31,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:27" (2/3) ... [2020-10-16 12:10:31,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e57963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:10:31, skipping insertion in model container [2020-10-16 12:10:31,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:10:31" (3/3) ... [2020-10-16 12:10:31,331 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i [2020-10-16 12:10:31,342 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:10:31,343 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:10:31,351 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:10:31,351 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:10:31,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,386 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,386 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,400 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,400 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,401 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,401 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,405 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,405 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,437 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,447 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,448 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,457 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,458 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:31,467 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:10:31,478 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:10:31,495 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:10:31,496 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:10:31,496 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:10:31,496 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:10:31,496 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:10:31,496 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:10:31,496 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:10:31,497 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:10:31,511 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:10:31,512 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 203 flow [2020-10-16 12:10:31,515 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 203 flow [2020-10-16 12:10:31,517 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 12:10:31,566 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 12:10:31,566 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:10:31,571 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 12:10:31,575 INFO L117 LiptonReduction]: Number of co-enabled transitions 1740 [2020-10-16 12:10:32,046 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:10:32,166 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:10:32,539 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 12:10:32,732 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:10:32,978 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:10:33,841 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-16 12:10:34,060 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 12:10:34,169 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 12:10:34,178 INFO L132 LiptonReduction]: Checked pairs total: 6058 [2020-10-16 12:10:34,178 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-16 12:10:34,184 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-16 12:10:34,271 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1346 states. [2020-10-16 12:10:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states. [2020-10-16 12:10:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:10:34,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:34,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:10:34,285 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:34,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:34,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1710719517, now seen corresponding path program 1 times [2020-10-16 12:10:34,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:34,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273842396] [2020-10-16 12:10:34,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:34,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273842396] [2020-10-16 12:10:34,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:34,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:10:34,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841963657] [2020-10-16 12:10:34,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:10:34,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:34,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:10:34,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:34,635 INFO L87 Difference]: Start difference. First operand 1346 states. Second operand 3 states. [2020-10-16 12:10:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:34,775 INFO L93 Difference]: Finished difference Result 1124 states and 3637 transitions. [2020-10-16 12:10:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:10:34,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:10:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:34,807 INFO L225 Difference]: With dead ends: 1124 [2020-10-16 12:10:34,808 INFO L226 Difference]: Without dead ends: 824 [2020-10-16 12:10:34,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-10-16 12:10:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2020-10-16 12:10:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2020-10-16 12:10:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2607 transitions. [2020-10-16 12:10:34,976 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2607 transitions. Word has length 5 [2020-10-16 12:10:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:34,977 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 2607 transitions. [2020-10-16 12:10:34,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:10:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2607 transitions. [2020-10-16 12:10:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:10:34,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:34,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:34,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:10:34,981 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:34,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:34,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1176658182, now seen corresponding path program 1 times [2020-10-16 12:10:34,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:34,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378077524] [2020-10-16 12:10:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:35,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378077524] [2020-10-16 12:10:35,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:35,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:10:35,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102526801] [2020-10-16 12:10:35,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:10:35,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:10:35,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:10:35,160 INFO L87 Difference]: Start difference. First operand 824 states and 2607 transitions. Second operand 4 states. [2020-10-16 12:10:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:35,209 INFO L93 Difference]: Finished difference Result 914 states and 2784 transitions. [2020-10-16 12:10:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:10:35,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 12:10:35,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:35,216 INFO L225 Difference]: With dead ends: 914 [2020-10-16 12:10:35,217 INFO L226 Difference]: Without dead ends: 764 [2020-10-16 12:10:35,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:35,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-10-16 12:10:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2020-10-16 12:10:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2020-10-16 12:10:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2389 transitions. [2020-10-16 12:10:35,248 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2389 transitions. Word has length 10 [2020-10-16 12:10:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:35,250 INFO L481 AbstractCegarLoop]: Abstraction has 764 states and 2389 transitions. [2020-10-16 12:10:35,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:10:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2389 transitions. [2020-10-16 12:10:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:10:35,252 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:35,253 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:35,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:10:35,253 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2078251640, now seen corresponding path program 1 times [2020-10-16 12:10:35,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:35,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298013745] [2020-10-16 12:10:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:35,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298013745] [2020-10-16 12:10:35,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:35,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:10:35,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753842153] [2020-10-16 12:10:35,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:10:35,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:10:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:35,430 INFO L87 Difference]: Start difference. First operand 764 states and 2389 transitions. Second operand 5 states. [2020-10-16 12:10:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:35,534 INFO L93 Difference]: Finished difference Result 1004 states and 3081 transitions. [2020-10-16 12:10:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:10:35,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:10:35,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:35,540 INFO L225 Difference]: With dead ends: 1004 [2020-10-16 12:10:35,540 INFO L226 Difference]: Without dead ends: 524 [2020-10-16 12:10:35,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:10:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-10-16 12:10:35,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2020-10-16 12:10:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-10-16 12:10:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1541 transitions. [2020-10-16 12:10:35,561 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1541 transitions. Word has length 11 [2020-10-16 12:10:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:35,562 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 1541 transitions. [2020-10-16 12:10:35,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:10:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1541 transitions. [2020-10-16 12:10:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:10:35,567 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:35,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:35,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:10:35,568 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash 361772746, now seen corresponding path program 1 times [2020-10-16 12:10:35,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:35,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280440930] [2020-10-16 12:10:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:35,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280440930] [2020-10-16 12:10:35,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:35,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:10:35,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909768285] [2020-10-16 12:10:35,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:10:35,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:10:35,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:10:35,739 INFO L87 Difference]: Start difference. First operand 524 states and 1541 transitions. Second operand 4 states. [2020-10-16 12:10:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:35,790 INFO L93 Difference]: Finished difference Result 524 states and 1493 transitions. [2020-10-16 12:10:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:10:35,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:10:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:35,796 INFO L225 Difference]: With dead ends: 524 [2020-10-16 12:10:35,796 INFO L226 Difference]: Without dead ends: 452 [2020-10-16 12:10:35,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:35,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-16 12:10:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-16 12:10:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-16 12:10:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1295 transitions. [2020-10-16 12:10:35,815 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1295 transitions. Word has length 13 [2020-10-16 12:10:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:35,816 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1295 transitions. [2020-10-16 12:10:35,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:10:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1295 transitions. [2020-10-16 12:10:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:10:35,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:35,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:35,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:10:35,818 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1717675043, now seen corresponding path program 1 times [2020-10-16 12:10:35,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:35,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418985238] [2020-10-16 12:10:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:36,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418985238] [2020-10-16 12:10:36,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:36,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:10:36,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128389910] [2020-10-16 12:10:36,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:10:36,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:36,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:10:36,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:36,253 INFO L87 Difference]: Start difference. First operand 452 states and 1295 transitions. Second operand 9 states. [2020-10-16 12:10:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:36,689 INFO L93 Difference]: Finished difference Result 556 states and 1579 transitions. [2020-10-16 12:10:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:10:36,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-16 12:10:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:36,694 INFO L225 Difference]: With dead ends: 556 [2020-10-16 12:10:36,695 INFO L226 Difference]: Without dead ends: 517 [2020-10-16 12:10:36,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-10-16 12:10:36,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-16 12:10:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 504. [2020-10-16 12:10:36,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-10-16 12:10:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1450 transitions. [2020-10-16 12:10:36,712 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1450 transitions. Word has length 16 [2020-10-16 12:10:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:36,713 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 1450 transitions. [2020-10-16 12:10:36,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:10:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1450 transitions. [2020-10-16 12:10:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:10:36,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:36,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:36,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:10:36,715 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:36,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1645143937, now seen corresponding path program 2 times [2020-10-16 12:10:36,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:36,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484542483] [2020-10-16 12:10:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:36,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484542483] [2020-10-16 12:10:36,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:36,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:10:36,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488412196] [2020-10-16 12:10:36,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:10:36,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:36,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:10:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:36,948 INFO L87 Difference]: Start difference. First operand 504 states and 1450 transitions. Second operand 9 states. [2020-10-16 12:10:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:37,327 INFO L93 Difference]: Finished difference Result 605 states and 1725 transitions. [2020-10-16 12:10:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:10:37,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-16 12:10:37,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:37,332 INFO L225 Difference]: With dead ends: 605 [2020-10-16 12:10:37,333 INFO L226 Difference]: Without dead ends: 569 [2020-10-16 12:10:37,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-16 12:10:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-10-16 12:10:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 517. [2020-10-16 12:10:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-16 12:10:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1492 transitions. [2020-10-16 12:10:37,351 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1492 transitions. Word has length 16 [2020-10-16 12:10:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:37,352 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1492 transitions. [2020-10-16 12:10:37,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:10:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1492 transitions. [2020-10-16 12:10:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:10:37,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:37,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:37,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:10:37,354 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:37,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash 732991879, now seen corresponding path program 3 times [2020-10-16 12:10:37,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:37,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527162294] [2020-10-16 12:10:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:37,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527162294] [2020-10-16 12:10:37,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:37,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:10:37,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011345532] [2020-10-16 12:10:37,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:10:37,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:37,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:10:37,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:37,605 INFO L87 Difference]: Start difference. First operand 517 states and 1492 transitions. Second operand 9 states. [2020-10-16 12:10:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:38,144 INFO L93 Difference]: Finished difference Result 957 states and 2694 transitions. [2020-10-16 12:10:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 12:10:38,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-16 12:10:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:38,152 INFO L225 Difference]: With dead ends: 957 [2020-10-16 12:10:38,153 INFO L226 Difference]: Without dead ends: 723 [2020-10-16 12:10:38,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:10:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-10-16 12:10:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 503. [2020-10-16 12:10:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2020-10-16 12:10:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1401 transitions. [2020-10-16 12:10:38,177 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1401 transitions. Word has length 16 [2020-10-16 12:10:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:38,178 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 1401 transitions. [2020-10-16 12:10:38,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:10:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1401 transitions. [2020-10-16 12:10:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:10:38,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:38,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:38,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:10:38,180 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash 452774403, now seen corresponding path program 1 times [2020-10-16 12:10:38,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:38,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051938284] [2020-10-16 12:10:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:38,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051938284] [2020-10-16 12:10:38,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:38,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:10:38,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580846286] [2020-10-16 12:10:38,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:10:38,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:10:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:10:38,357 INFO L87 Difference]: Start difference. First operand 503 states and 1401 transitions. Second operand 4 states. [2020-10-16 12:10:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:38,388 INFO L93 Difference]: Finished difference Result 486 states and 1207 transitions. [2020-10-16 12:10:38,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:10:38,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-16 12:10:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:38,392 INFO L225 Difference]: With dead ends: 486 [2020-10-16 12:10:38,392 INFO L226 Difference]: Without dead ends: 369 [2020-10-16 12:10:38,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-10-16 12:10:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2020-10-16 12:10:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-10-16 12:10:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 897 transitions. [2020-10-16 12:10:38,411 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 897 transitions. Word has length 17 [2020-10-16 12:10:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:38,411 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 897 transitions. [2020-10-16 12:10:38,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:10:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 897 transitions. [2020-10-16 12:10:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:10:38,413 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:38,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:38,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:10:38,413 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1797287306, now seen corresponding path program 1 times [2020-10-16 12:10:38,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:38,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487830721] [2020-10-16 12:10:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:38,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487830721] [2020-10-16 12:10:38,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:38,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:10:38,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488084203] [2020-10-16 12:10:38,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:10:38,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:38,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:10:38,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:38,592 INFO L87 Difference]: Start difference. First operand 369 states and 897 transitions. Second operand 5 states. [2020-10-16 12:10:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:38,633 INFO L93 Difference]: Finished difference Result 305 states and 686 transitions. [2020-10-16 12:10:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:10:38,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-16 12:10:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:38,635 INFO L225 Difference]: With dead ends: 305 [2020-10-16 12:10:38,636 INFO L226 Difference]: Without dead ends: 245 [2020-10-16 12:10:38,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:10:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-16 12:10:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2020-10-16 12:10:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-16 12:10:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 533 transitions. [2020-10-16 12:10:38,644 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 533 transitions. Word has length 18 [2020-10-16 12:10:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:38,644 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 533 transitions. [2020-10-16 12:10:38,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:10:38,644 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 533 transitions. [2020-10-16 12:10:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:10:38,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:38,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:38,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:10:38,646 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:38,646 INFO L82 PathProgramCache]: Analyzing trace with hash -897419567, now seen corresponding path program 1 times [2020-10-16 12:10:38,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:38,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170901874] [2020-10-16 12:10:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:38,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170901874] [2020-10-16 12:10:38,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:38,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:10:38,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701105815] [2020-10-16 12:10:38,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:10:38,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:10:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:10:38,839 INFO L87 Difference]: Start difference. First operand 242 states and 533 transitions. Second operand 6 states. [2020-10-16 12:10:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:38,884 INFO L93 Difference]: Finished difference Result 217 states and 481 transitions. [2020-10-16 12:10:38,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:10:38,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:10:38,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:38,887 INFO L225 Difference]: With dead ends: 217 [2020-10-16 12:10:38,887 INFO L226 Difference]: Without dead ends: 204 [2020-10-16 12:10:38,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:10:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-16 12:10:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168. [2020-10-16 12:10:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-16 12:10:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 379 transitions. [2020-10-16 12:10:38,894 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 379 transitions. Word has length 20 [2020-10-16 12:10:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:38,895 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 379 transitions. [2020-10-16 12:10:38,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:10:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 379 transitions. [2020-10-16 12:10:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:38,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:38,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:38,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:10:38,896 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash -48895144, now seen corresponding path program 1 times [2020-10-16 12:10:38,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:38,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456988843] [2020-10-16 12:10:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:39,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456988843] [2020-10-16 12:10:39,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:39,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:10:39,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65188512] [2020-10-16 12:10:39,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:10:39,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:10:39,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:10:39,197 INFO L87 Difference]: Start difference. First operand 168 states and 379 transitions. Second operand 7 states. [2020-10-16 12:10:39,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:39,523 INFO L93 Difference]: Finished difference Result 321 states and 698 transitions. [2020-10-16 12:10:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:10:39,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-16 12:10:39,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:39,526 INFO L225 Difference]: With dead ends: 321 [2020-10-16 12:10:39,526 INFO L226 Difference]: Without dead ends: 255 [2020-10-16 12:10:39,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:10:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-16 12:10:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 220. [2020-10-16 12:10:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-10-16 12:10:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 496 transitions. [2020-10-16 12:10:39,535 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 496 transitions. Word has length 23 [2020-10-16 12:10:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:39,535 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 496 transitions. [2020-10-16 12:10:39,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:10:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 496 transitions. [2020-10-16 12:10:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:39,536 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:39,536 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:39,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:10:39,537 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1940087594, now seen corresponding path program 2 times [2020-10-16 12:10:39,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:39,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997019586] [2020-10-16 12:10:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:39,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997019586] [2020-10-16 12:10:39,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:39,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:10:39,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660985187] [2020-10-16 12:10:39,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:10:39,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:10:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:39,915 INFO L87 Difference]: Start difference. First operand 220 states and 496 transitions. Second operand 9 states. [2020-10-16 12:10:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:40,254 INFO L93 Difference]: Finished difference Result 266 states and 584 transitions. [2020-10-16 12:10:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 12:10:40,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-16 12:10:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:40,257 INFO L225 Difference]: With dead ends: 266 [2020-10-16 12:10:40,257 INFO L226 Difference]: Without dead ends: 206 [2020-10-16 12:10:40,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:10:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-16 12:10:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 196. [2020-10-16 12:10:40,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-16 12:10:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 446 transitions. [2020-10-16 12:10:40,263 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 446 transitions. Word has length 23 [2020-10-16 12:10:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:40,264 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 446 transitions. [2020-10-16 12:10:40,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:10:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 446 transitions. [2020-10-16 12:10:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:40,265 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:40,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:40,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:10:40,265 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1638973074, now seen corresponding path program 3 times [2020-10-16 12:10:40,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:40,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456527056] [2020-10-16 12:10:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:40,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456527056] [2020-10-16 12:10:40,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:40,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-16 12:10:40,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84123256] [2020-10-16 12:10:40,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-16 12:10:40,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-16 12:10:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:10:40,872 INFO L87 Difference]: Start difference. First operand 196 states and 446 transitions. Second operand 15 states. [2020-10-16 12:10:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:41,918 INFO L93 Difference]: Finished difference Result 274 states and 592 transitions. [2020-10-16 12:10:41,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-16 12:10:41,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-10-16 12:10:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:41,920 INFO L225 Difference]: With dead ends: 274 [2020-10-16 12:10:41,921 INFO L226 Difference]: Without dead ends: 216 [2020-10-16 12:10:41,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2020-10-16 12:10:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-16 12:10:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 196. [2020-10-16 12:10:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-16 12:10:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 439 transitions. [2020-10-16 12:10:41,928 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 439 transitions. Word has length 23 [2020-10-16 12:10:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:41,928 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 439 transitions. [2020-10-16 12:10:41,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-16 12:10:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 439 transitions. [2020-10-16 12:10:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:41,929 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:41,929 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:41,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:10:41,930 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1205062680, now seen corresponding path program 4 times [2020-10-16 12:10:41,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:41,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003696796] [2020-10-16 12:10:41,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:42,523 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2020-10-16 12:10:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:42,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003696796] [2020-10-16 12:10:42,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:42,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-16 12:10:42,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88667947] [2020-10-16 12:10:42,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-16 12:10:42,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:42,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-16 12:10:42,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:10:42,912 INFO L87 Difference]: Start difference. First operand 196 states and 439 transitions. Second operand 15 states. [2020-10-16 12:10:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:44,617 INFO L93 Difference]: Finished difference Result 268 states and 573 transitions. [2020-10-16 12:10:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-16 12:10:44,618 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-10-16 12:10:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:44,620 INFO L225 Difference]: With dead ends: 268 [2020-10-16 12:10:44,620 INFO L226 Difference]: Without dead ends: 241 [2020-10-16 12:10:44,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2020-10-16 12:10:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-10-16 12:10:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 192. [2020-10-16 12:10:44,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-10-16 12:10:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 428 transitions. [2020-10-16 12:10:44,627 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 428 transitions. Word has length 23 [2020-10-16 12:10:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:44,627 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 428 transitions. [2020-10-16 12:10:44,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-16 12:10:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 428 transitions. [2020-10-16 12:10:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:44,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:44,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:44,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:10:44,629 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 221696666, now seen corresponding path program 5 times [2020-10-16 12:10:44,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:44,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106467502] [2020-10-16 12:10:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:45,039 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2020-10-16 12:10:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:45,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106467502] [2020-10-16 12:10:45,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:45,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-16 12:10:45,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69979624] [2020-10-16 12:10:45,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-16 12:10:45,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:45,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-16 12:10:45,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-16 12:10:45,641 INFO L87 Difference]: Start difference. First operand 192 states and 428 transitions. Second operand 15 states. [2020-10-16 12:10:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:46,860 INFO L93 Difference]: Finished difference Result 277 states and 600 transitions. [2020-10-16 12:10:46,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-16 12:10:46,860 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-10-16 12:10:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:46,862 INFO L225 Difference]: With dead ends: 277 [2020-10-16 12:10:46,862 INFO L226 Difference]: Without dead ends: 224 [2020-10-16 12:10:46,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2020-10-16 12:10:46,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-16 12:10:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 176. [2020-10-16 12:10:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-16 12:10:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 397 transitions. [2020-10-16 12:10:46,869 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 397 transitions. Word has length 23 [2020-10-16 12:10:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:46,870 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 397 transitions. [2020-10-16 12:10:46,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-16 12:10:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 397 transitions. [2020-10-16 12:10:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:46,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:46,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:46,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:10:46,871 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:46,872 INFO L82 PathProgramCache]: Analyzing trace with hash 289309428, now seen corresponding path program 6 times [2020-10-16 12:10:46,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:46,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241661614] [2020-10-16 12:10:46,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:47,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241661614] [2020-10-16 12:10:47,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:47,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:10:47,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108954391] [2020-10-16 12:10:47,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:10:47,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:47,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:10:47,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:47,304 INFO L87 Difference]: Start difference. First operand 176 states and 397 transitions. Second operand 9 states. [2020-10-16 12:10:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:47,737 INFO L93 Difference]: Finished difference Result 216 states and 472 transitions. [2020-10-16 12:10:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:10:47,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-16 12:10:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:47,739 INFO L225 Difference]: With dead ends: 216 [2020-10-16 12:10:47,739 INFO L226 Difference]: Without dead ends: 185 [2020-10-16 12:10:47,740 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:10:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-16 12:10:47,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2020-10-16 12:10:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-10-16 12:10:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 349 transitions. [2020-10-16 12:10:47,744 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 349 transitions. Word has length 23 [2020-10-16 12:10:47,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:47,745 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 349 transitions. [2020-10-16 12:10:47,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:10:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 349 transitions. [2020-10-16 12:10:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:47,746 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:47,746 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:47,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:10:47,746 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:47,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:47,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2016675130, now seen corresponding path program 7 times [2020-10-16 12:10:47,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:47,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402927544] [2020-10-16 12:10:47,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:48,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402927544] [2020-10-16 12:10:48,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:48,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 12:10:48,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765299598] [2020-10-16 12:10:48,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 12:10:48,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:48,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 12:10:48,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:10:48,100 INFO L87 Difference]: Start difference. First operand 160 states and 349 transitions. Second operand 10 states. [2020-10-16 12:10:48,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:48,618 INFO L93 Difference]: Finished difference Result 217 states and 453 transitions. [2020-10-16 12:10:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 12:10:48,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-16 12:10:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:48,621 INFO L225 Difference]: With dead ends: 217 [2020-10-16 12:10:48,621 INFO L226 Difference]: Without dead ends: 158 [2020-10-16 12:10:48,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-10-16 12:10:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-16 12:10:48,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2020-10-16 12:10:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-16 12:10:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 290 transitions. [2020-10-16 12:10:48,626 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 290 transitions. Word has length 23 [2020-10-16 12:10:48,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:48,626 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 290 transitions. [2020-10-16 12:10:48,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 12:10:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 290 transitions. [2020-10-16 12:10:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:48,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:48,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:48,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 12:10:48,627 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash 159750070, now seen corresponding path program 8 times [2020-10-16 12:10:48,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:48,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230201504] [2020-10-16 12:10:48,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:48,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230201504] [2020-10-16 12:10:48,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:48,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:10:48,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081891410] [2020-10-16 12:10:48,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:10:48,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:10:48,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:10:48,792 INFO L87 Difference]: Start difference. First operand 139 states and 290 transitions. Second operand 6 states. [2020-10-16 12:10:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:49,017 INFO L93 Difference]: Finished difference Result 168 states and 338 transitions. [2020-10-16 12:10:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:10:49,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-16 12:10:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:49,019 INFO L225 Difference]: With dead ends: 168 [2020-10-16 12:10:49,020 INFO L226 Difference]: Without dead ends: 131 [2020-10-16 12:10:49,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-16 12:10:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-10-16 12:10:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-16 12:10:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 268 transitions. [2020-10-16 12:10:49,025 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 268 transitions. Word has length 23 [2020-10-16 12:10:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:49,026 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 268 transitions. [2020-10-16 12:10:49,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:10:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 268 transitions. [2020-10-16 12:10:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:49,027 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:49,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:49,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 12:10:49,028 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:49,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:49,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2128492446, now seen corresponding path program 9 times [2020-10-16 12:10:49,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:49,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800104508] [2020-10-16 12:10:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:49,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800104508] [2020-10-16 12:10:49,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:49,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:10:49,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360498655] [2020-10-16 12:10:49,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:10:49,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:49,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:10:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:10:49,266 INFO L87 Difference]: Start difference. First operand 131 states and 268 transitions. Second operand 8 states. [2020-10-16 12:10:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:49,527 INFO L93 Difference]: Finished difference Result 181 states and 369 transitions. [2020-10-16 12:10:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:10:49,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-16 12:10:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:49,529 INFO L225 Difference]: With dead ends: 181 [2020-10-16 12:10:49,529 INFO L226 Difference]: Without dead ends: 126 [2020-10-16 12:10:49,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:10:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-16 12:10:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2020-10-16 12:10:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-16 12:10:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 266 transitions. [2020-10-16 12:10:49,535 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 266 transitions. Word has length 23 [2020-10-16 12:10:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:49,536 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 266 transitions. [2020-10-16 12:10:49,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:10:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 266 transitions. [2020-10-16 12:10:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:49,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:49,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:49,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 12:10:49,538 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:49,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:49,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1955168434, now seen corresponding path program 10 times [2020-10-16 12:10:49,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:49,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675514821] [2020-10-16 12:10:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:49,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:49,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675514821] [2020-10-16 12:10:49,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:49,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:10:49,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59120602] [2020-10-16 12:10:49,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:10:49,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:49,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:10:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:10:49,973 INFO L87 Difference]: Start difference. First operand 126 states and 266 transitions. Second operand 11 states. [2020-10-16 12:10:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:50,689 INFO L93 Difference]: Finished difference Result 153 states and 303 transitions. [2020-10-16 12:10:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 12:10:50,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-10-16 12:10:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:50,690 INFO L225 Difference]: With dead ends: 153 [2020-10-16 12:10:50,690 INFO L226 Difference]: Without dead ends: 137 [2020-10-16 12:10:50,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:10:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-10-16 12:10:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2020-10-16 12:10:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-16 12:10:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 262 transitions. [2020-10-16 12:10:50,695 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 262 transitions. Word has length 23 [2020-10-16 12:10:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:50,695 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 262 transitions. [2020-10-16 12:10:50,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:10:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 262 transitions. [2020-10-16 12:10:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:50,697 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:50,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:50,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 12:10:50,698 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:50,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1542624538, now seen corresponding path program 11 times [2020-10-16 12:10:50,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:50,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346483048] [2020-10-16 12:10:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:51,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346483048] [2020-10-16 12:10:51,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:51,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:10:51,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740782022] [2020-10-16 12:10:51,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:10:51,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:10:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:10:51,061 INFO L87 Difference]: Start difference. First operand 126 states and 262 transitions. Second operand 11 states. [2020-10-16 12:10:51,185 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2020-10-16 12:10:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:51,680 INFO L93 Difference]: Finished difference Result 142 states and 283 transitions. [2020-10-16 12:10:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 12:10:51,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-10-16 12:10:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:51,682 INFO L225 Difference]: With dead ends: 142 [2020-10-16 12:10:51,682 INFO L226 Difference]: Without dead ends: 121 [2020-10-16 12:10:51,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-10-16 12:10:51,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-16 12:10:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2020-10-16 12:10:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-16 12:10:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 239 transitions. [2020-10-16 12:10:51,686 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 239 transitions. Word has length 23 [2020-10-16 12:10:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:51,688 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 239 transitions. [2020-10-16 12:10:51,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:10:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 239 transitions. [2020-10-16 12:10:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:51,688 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:51,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:51,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 12:10:51,689 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:51,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2132379118, now seen corresponding path program 12 times [2020-10-16 12:10:51,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:51,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398664994] [2020-10-16 12:10:51,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:52,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398664994] [2020-10-16 12:10:52,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:52,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:10:52,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804681812] [2020-10-16 12:10:52,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:10:52,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:52,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:10:52,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:10:52,032 INFO L87 Difference]: Start difference. First operand 118 states and 239 transitions. Second operand 11 states. [2020-10-16 12:10:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:52,716 INFO L93 Difference]: Finished difference Result 158 states and 308 transitions. [2020-10-16 12:10:52,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:10:52,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-10-16 12:10:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:52,718 INFO L225 Difference]: With dead ends: 158 [2020-10-16 12:10:52,718 INFO L226 Difference]: Without dead ends: 129 [2020-10-16 12:10:52,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:10:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-16 12:10:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2020-10-16 12:10:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-16 12:10:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 223 transitions. [2020-10-16 12:10:52,722 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 223 transitions. Word has length 23 [2020-10-16 12:10:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:52,723 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 223 transitions. [2020-10-16 12:10:52,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:10:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 223 transitions. [2020-10-16 12:10:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:52,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:52,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:52,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 12:10:52,724 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1553830094, now seen corresponding path program 13 times [2020-10-16 12:10:52,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:52,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697677538] [2020-10-16 12:10:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:53,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697677538] [2020-10-16 12:10:53,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:53,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 12:10:53,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423008431] [2020-10-16 12:10:53,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 12:10:53,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:53,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 12:10:53,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-16 12:10:53,044 INFO L87 Difference]: Start difference. First operand 110 states and 223 transitions. Second operand 11 states. [2020-10-16 12:10:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:53,571 INFO L93 Difference]: Finished difference Result 146 states and 292 transitions. [2020-10-16 12:10:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 12:10:53,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-10-16 12:10:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:53,574 INFO L225 Difference]: With dead ends: 146 [2020-10-16 12:10:53,575 INFO L226 Difference]: Without dead ends: 106 [2020-10-16 12:10:53,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-10-16 12:10:53,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-16 12:10:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2020-10-16 12:10:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-16 12:10:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 198 transitions. [2020-10-16 12:10:53,579 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 198 transitions. Word has length 23 [2020-10-16 12:10:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:53,579 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 198 transitions. [2020-10-16 12:10:53,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 12:10:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 198 transitions. [2020-10-16 12:10:53,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:53,580 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:53,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:53,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 12:10:53,581 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:53,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:53,581 INFO L82 PathProgramCache]: Analyzing trace with hash 51556346, now seen corresponding path program 14 times [2020-10-16 12:10:53,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:53,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561385942] [2020-10-16 12:10:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:53,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561385942] [2020-10-16 12:10:53,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:53,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:10:53,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728805500] [2020-10-16 12:10:53,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:10:53,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:53,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:10:53,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:10:53,768 INFO L87 Difference]: Start difference. First operand 103 states and 198 transitions. Second operand 8 states. [2020-10-16 12:10:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:53,942 INFO L93 Difference]: Finished difference Result 142 states and 264 transitions. [2020-10-16 12:10:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:10:53,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-16 12:10:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:53,944 INFO L225 Difference]: With dead ends: 142 [2020-10-16 12:10:53,944 INFO L226 Difference]: Without dead ends: 91 [2020-10-16 12:10:53,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-16 12:10:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-10-16 12:10:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-16 12:10:53,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 171 transitions. [2020-10-16 12:10:53,948 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 171 transitions. Word has length 23 [2020-10-16 12:10:53,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:53,949 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 171 transitions. [2020-10-16 12:10:53,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:10:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 171 transitions. [2020-10-16 12:10:53,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:53,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:53,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:53,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 12:10:53,950 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:53,950 INFO L82 PathProgramCache]: Analyzing trace with hash -38633998, now seen corresponding path program 15 times [2020-10-16 12:10:53,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:53,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726120993] [2020-10-16 12:10:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:10:54,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726120993] [2020-10-16 12:10:54,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:54,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:10:54,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787329421] [2020-10-16 12:10:54,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:10:54,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:54,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:10:54,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:10:54,182 INFO L87 Difference]: Start difference. First operand 91 states and 171 transitions. Second operand 8 states. [2020-10-16 12:10:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:54,510 INFO L93 Difference]: Finished difference Result 151 states and 284 transitions. [2020-10-16 12:10:54,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:10:54,511 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-16 12:10:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:54,512 INFO L225 Difference]: With dead ends: 151 [2020-10-16 12:10:54,512 INFO L226 Difference]: Without dead ends: 80 [2020-10-16 12:10:54,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:10:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-10-16 12:10:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2020-10-16 12:10:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-16 12:10:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2020-10-16 12:10:54,516 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 23 [2020-10-16 12:10:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:54,517 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2020-10-16 12:10:54,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:10:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2020-10-16 12:10:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-16 12:10:54,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:54,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:54,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 12:10:54,518 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:54,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:54,518 INFO L82 PathProgramCache]: Analyzing trace with hash -725561230, now seen corresponding path program 16 times [2020-10-16 12:10:54,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:54,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118432865] [2020-10-16 12:10:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:10:54,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:10:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:10:54,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:10:54,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:10:54,811 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:10:54,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 12:10:54,844 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,846 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,847 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,848 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,849 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,850 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,851 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,852 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,853 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,853 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,854 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,855 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,856 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,856 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,856 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,857 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,857 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,857 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,858 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,858 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,859 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,860 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,860 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,861 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,862 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,863 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,864 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,865 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,866 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,867 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,868 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,869 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,870 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,871 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,871 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,872 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,872 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,872 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,872 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,872 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,873 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,873 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,873 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,873 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,873 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,874 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,874 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,874 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,874 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,875 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:10:54,875 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:54,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:10:54 BasicIcfg [2020-10-16 12:10:54,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:10:54,990 INFO L168 Benchmark]: Toolchain (without parser) took 28401.09 ms. Allocated memory was 139.5 MB in the beginning and 582.0 MB in the end (delta: 442.5 MB). Free memory was 100.9 MB in the beginning and 443.1 MB in the end (delta: -342.2 MB). Peak memory consumption was 100.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:54,991 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:10:54,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.98 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 155.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:54,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.43 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 151.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:54,992 INFO L168 Benchmark]: Boogie Preprocessor took 54.35 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 148.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:54,999 INFO L168 Benchmark]: RCFGBuilder took 3765.10 ms. Allocated memory was 203.9 MB in the beginning and 295.7 MB in the end (delta: 91.8 MB). Free memory was 148.3 MB in the beginning and 225.4 MB in the end (delta: -77.1 MB). Peak memory consumption was 107.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:55,000 INFO L168 Benchmark]: TraceAbstraction took 23662.62 ms. Allocated memory was 295.7 MB in the beginning and 582.0 MB in the end (delta: 286.3 MB). Free memory was 225.4 MB in the beginning and 443.1 MB in the end (delta: -217.7 MB). Peak memory consumption was 68.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:55,005 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.98 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 155.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.43 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 151.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.35 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 148.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3765.10 ms. Allocated memory was 203.9 MB in the beginning and 295.7 MB in the end (delta: 91.8 MB). Free memory was 148.3 MB in the beginning and 225.4 MB in the end (delta: -77.1 MB). Peak memory consumption was 107.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23662.62 ms. Allocated memory was 295.7 MB in the beginning and 582.0 MB in the end (delta: 286.3 MB). Free memory was 225.4 MB in the beginning and 443.1 MB in the end (delta: -217.7 MB). Peak memory consumption was 68.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 794 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.6s, 102 PlacesBefore, 39 PlacesAfterwards, 94 TransitionsBefore, 30 TransitionsAfterwards, 1740 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 6058 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff1_thd0; [L719] 0 _Bool y$r_buff1_thd1; [L720] 0 _Bool y$r_buff1_thd2; [L721] 0 _Bool y$r_buff1_thd3; [L722] 0 _Bool y$read_delayed; [L723] 0 int *y$read_delayed_var; [L724] 0 int y$w_buff0; [L725] 0 _Bool y$w_buff0_used; [L726] 0 int y$w_buff1; [L727] 0 _Bool y$w_buff1_used; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L843] 0 pthread_t t2333; [L844] FCALL, FORK 0 pthread_create(&t2333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 pthread_t t2334; [L846] FCALL, FORK 0 pthread_create(&t2334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 2 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 pthread_t t2335; [L848] FCALL, FORK 0 pthread_create(&t2335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L733] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 1 y$flush_delayed = weak$$choice2 [L746] 1 y$mem_tmp = y [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L748] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L751] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 __unbuffered_p0_EAX = y [L755] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L755] 1 y = y$flush_delayed ? y$mem_tmp : y [L756] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L763] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.3s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 642 SDtfs, 1114 SDslu, 2435 SDs, 0 SdLazy, 3537 SolverSat, 597 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1346occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 586 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 115833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...