/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:29:25,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:29:25,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:29:25,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:29:25,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:29:25,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:29:25,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:29:25,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:29:25,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:29:25,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:29:25,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:29:25,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:29:25,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:29:25,409 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:29:25,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:29:25,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:29:25,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:29:25,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:29:25,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:29:25,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:29:25,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:29:25,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:29:25,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:29:25,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:29:25,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:29:25,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:29:25,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:29:25,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:29:25,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:29:25,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:29:25,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:29:25,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:29:25,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:29:25,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:29:25,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:29:25,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:29:25,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:29:25,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:29:25,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:29:25,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:29:25,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:29:25,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:29:25,463 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:29:25,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:29:25,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:29:25,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:29:25,465 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:29:25,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:29:25,466 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:29:25,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:29:25,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:29:25,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:29:25,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:29:25,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:29:25,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:29:25,467 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:29:25,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:29:25,467 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:29:25,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:29:25,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:29:25,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:29:25,468 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:29:25,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:29:25,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:29:25,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:29:25,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:29:25,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:29:25,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:29:25,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:29:25,470 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:29:25,470 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:29:25,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:29:25,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:29:25,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:29:25,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:29:25,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:29:25,758 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:29:25,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-27 07:29:25,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699fd6602/7a7f6fa7715a4f2e941702e84b5311d4/FLAG7a0219012 [2019-12-27 07:29:26,410 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:29:26,411 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc.i [2019-12-27 07:29:26,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699fd6602/7a7f6fa7715a4f2e941702e84b5311d4/FLAG7a0219012 [2019-12-27 07:29:26,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/699fd6602/7a7f6fa7715a4f2e941702e84b5311d4 [2019-12-27 07:29:26,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:29:26,684 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:29:26,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:29:26,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:29:26,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:29:26,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:29:26" (1/1) ... [2019-12-27 07:29:26,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:26, skipping insertion in model container [2019-12-27 07:29:26,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:29:26" (1/1) ... [2019-12-27 07:29:26,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:29:26,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:29:27,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:29:27,247 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:29:27,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:29:27,395 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:29:27,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27 WrapperNode [2019-12-27 07:29:27,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:29:27,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:29:27,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:29:27,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:29:27,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:29:27,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:29:27,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:29:27,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:29:27,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... [2019-12-27 07:29:27,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:29:27,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:29:27,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:29:27,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:29:27,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-12-27 07:29:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:29:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:29:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:29:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:29:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:29:27,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:29:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:29:27,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:29:27,584 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:29:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:29:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:29:27,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:29:27,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:29:27,587 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:29:28,382 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:29:28,383 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:29:28,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:29:28 BoogieIcfgContainer [2019-12-27 07:29:28,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:29:28,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:29:28,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:29:28,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:29:28,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:29:26" (1/3) ... [2019-12-27 07:29:28,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c316ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:29:28, skipping insertion in model container [2019-12-27 07:29:28,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:29:27" (2/3) ... [2019-12-27 07:29:28,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c316ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:29:28, skipping insertion in model container [2019-12-27 07:29:28,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:29:28" (3/3) ... [2019-12-27 07:29:28,393 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc.i [2019-12-27 07:29:28,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:29:28,403 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:29:28,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:29:28,411 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:29:28,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,451 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,491 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,492 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,499 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,499 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,514 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,517 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,517 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:29:28,536 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:29:28,555 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:29:28,556 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:29:28,556 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:29:28,556 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:29:28,556 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:29:28,556 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:29:28,556 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:29:28,556 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:29:28,573 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 07:29:28,575 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:29:28,676 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:29:28,676 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:29:28,696 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:29:28,718 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 07:29:28,808 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 07:29:28,808 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:29:28,818 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 07:29:28,840 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 07:29:28,841 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:29:29,015 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-27 07:29:32,412 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 07:29:32,560 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 07:29:32,638 INFO L206 etLargeBlockEncoding]: Checked pairs total: 69182 [2019-12-27 07:29:32,638 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 07:29:32,641 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 07:29:46,422 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 07:29:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 07:29:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:29:46,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:46,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:29:46,432 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash 794638691, now seen corresponding path program 1 times [2019-12-27 07:29:46,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:46,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993385341] [2019-12-27 07:29:46,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:46,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993385341] [2019-12-27 07:29:46,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:46,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:29:46,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123263295] [2019-12-27 07:29:46,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:29:46,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:29:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:29:46,724 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 07:29:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:29:47,714 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 07:29:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:29:47,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:29:47,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:29:50,613 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 07:29:50,619 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 07:29:50,620 INFO L631 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 [2019-12-27 07:29:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 07:29:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 07:29:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 07:29:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 07:29:56,512 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 07:29:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:29:56,513 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 07:29:56,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:29:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 07:29:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:29:56,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:29:56,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:29:56,525 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:29:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:29:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2064286334, now seen corresponding path program 1 times [2019-12-27 07:29:56,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:29:56,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636422172] [2019-12-27 07:29:56,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:29:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:29:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:29:56,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636422172] [2019-12-27 07:29:56,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:29:56,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:29:56,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970426499] [2019-12-27 07:29:56,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:29:56,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:29:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:29:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:29:56,680 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 07:30:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:30:01,278 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 07:30:01,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:30:01,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:30:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:30:01,903 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 07:30:01,903 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 07:30:01,904 INFO L631 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 [2019-12-27 07:30:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 07:30:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 07:30:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 07:30:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 07:30:09,881 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 07:30:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:30:09,882 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 07:30:09,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:30:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 07:30:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:30:09,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:30:09,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:30:09,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:30:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:30:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1769810709, now seen corresponding path program 1 times [2019-12-27 07:30:09,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:30:09,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406083816] [2019-12-27 07:30:09,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:30:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:30:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:30:09,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406083816] [2019-12-27 07:30:09,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:30:09,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:30:09,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996573419] [2019-12-27 07:30:09,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:30:09,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:30:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:30:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:30:09,988 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 07:30:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:30:14,765 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-27 07:30:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:30:14,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:30:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:30:15,240 INFO L225 Difference]: With dead ends: 161841 [2019-12-27 07:30:15,241 INFO L226 Difference]: Without dead ends: 161729 [2019-12-27 07:30:15,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:30:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-27 07:30:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-27 07:30:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-27 07:30:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-27 07:30:26,348 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-27 07:30:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:30:26,349 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-27 07:30:26,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:30:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-27 07:30:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:30:26,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:30:26,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:30:26,353 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:30:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:30:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 37773354, now seen corresponding path program 1 times [2019-12-27 07:30:26,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:30:26,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040764964] [2019-12-27 07:30:26,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:30:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:30:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:30:26,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040764964] [2019-12-27 07:30:26,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:30:26,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:30:26,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982716618] [2019-12-27 07:30:26,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:30:26,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:30:26,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:30:26,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:30:26,421 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 3 states. [2019-12-27 07:30:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:30:28,435 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-27 07:30:28,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:30:28,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:30:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:30:28,997 INFO L225 Difference]: With dead ends: 181948 [2019-12-27 07:30:28,998 INFO L226 Difference]: Without dead ends: 181948 [2019-12-27 07:30:28,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:30:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-27 07:30:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-27 07:30:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-27 07:30:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-27 07:30:41,548 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-27 07:30:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:30:41,548 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-27 07:30:41,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:30:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-27 07:30:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:30:41,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:30:41,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:30:41,552 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:30:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:30:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash 37638690, now seen corresponding path program 1 times [2019-12-27 07:30:41,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:30:41,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627070806] [2019-12-27 07:30:41,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:30:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:30:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:30:41,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627070806] [2019-12-27 07:30:41,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:30:41,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:30:41,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647729251] [2019-12-27 07:30:41,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:30:41,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:30:41,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:30:41,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:30:41,644 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 4 states. [2019-12-27 07:30:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:30:44,037 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-27 07:30:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:30:44,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:30:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:30:44,568 INFO L225 Difference]: With dead ends: 176806 [2019-12-27 07:30:44,569 INFO L226 Difference]: Without dead ends: 176726 [2019-12-27 07:30:44,569 INFO L631 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 [2019-12-27 07:30:54,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-27 07:30:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-27 07:30:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-27 07:30:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-27 07:30:58,239 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-27 07:30:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:30:58,240 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-27 07:30:58,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:30:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-27 07:30:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:30:58,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:30:58,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:30:58,245 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:30:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:30:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash 197780815, now seen corresponding path program 1 times [2019-12-27 07:30:58,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:30:58,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27863972] [2019-12-27 07:30:58,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:30:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:30:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:30:58,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27863972] [2019-12-27 07:30:58,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:30:58,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:30:58,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43452804] [2019-12-27 07:30:58,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:30:58,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:30:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:30:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:30:58,309 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 4 states. [2019-12-27 07:31:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:00,784 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-27 07:31:00,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:31:00,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:31:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:01,321 INFO L225 Difference]: With dead ends: 181899 [2019-12-27 07:31:01,322 INFO L226 Difference]: Without dead ends: 181811 [2019-12-27 07:31:01,322 INFO L631 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 [2019-12-27 07:31:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-27 07:31:15,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-27 07:31:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-27 07:31:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-27 07:31:16,546 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-27 07:31:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:16,547 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-27 07:31:16,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:31:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-27 07:31:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 07:31:16,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:16,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:16,571 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash -538416332, now seen corresponding path program 1 times [2019-12-27 07:31:16,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:16,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138195784] [2019-12-27 07:31:16,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:16,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138195784] [2019-12-27 07:31:16,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:16,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:31:16,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902011708] [2019-12-27 07:31:16,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:31:16,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:31:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:31:16,626 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-27 07:31:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:17,449 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-27 07:31:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:31:17,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 07:31:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:17,919 INFO L225 Difference]: With dead ends: 155313 [2019-12-27 07:31:17,919 INFO L226 Difference]: Without dead ends: 155313 [2019-12-27 07:31:17,919 INFO L631 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 [2019-12-27 07:31:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-27 07:31:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-27 07:31:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-27 07:31:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-27 07:31:31,224 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-27 07:31:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:31,224 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-27 07:31:31,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:31:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-27 07:31:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:31:31,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:31,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:31,251 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:31,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:31,252 INFO L82 PathProgramCache]: Analyzing trace with hash -919407984, now seen corresponding path program 1 times [2019-12-27 07:31:31,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:31,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091157406] [2019-12-27 07:31:31,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:31,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091157406] [2019-12-27 07:31:31,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:31,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:31:31,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852284596] [2019-12-27 07:31:31,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:31:31,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:31,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:31:31,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:31:31,305 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 4 states. [2019-12-27 07:31:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:38,330 INFO L93 Difference]: Finished difference Result 286953 states and 1185326 transitions. [2019-12-27 07:31:38,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:31:38,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 07:31:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:38,825 INFO L225 Difference]: With dead ends: 286953 [2019-12-27 07:31:38,825 INFO L226 Difference]: Without dead ends: 164501 [2019-12-27 07:31:38,826 INFO L631 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 [2019-12-27 07:31:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164501 states. [2019-12-27 07:31:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164501 to 163553. [2019-12-27 07:31:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163553 states. [2019-12-27 07:31:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163553 states to 163553 states and 668264 transitions. [2019-12-27 07:31:47,113 INFO L78 Accepts]: Start accepts. Automaton has 163553 states and 668264 transitions. Word has length 19 [2019-12-27 07:31:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:47,114 INFO L462 AbstractCegarLoop]: Abstraction has 163553 states and 668264 transitions. [2019-12-27 07:31:47,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:31:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 163553 states and 668264 transitions. [2019-12-27 07:31:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:31:47,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:47,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:47,132 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:47,132 INFO L82 PathProgramCache]: Analyzing trace with hash -112975457, now seen corresponding path program 1 times [2019-12-27 07:31:47,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:47,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555601311] [2019-12-27 07:31:47,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:47,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:47,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555601311] [2019-12-27 07:31:47,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:47,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:31:47,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089482939] [2019-12-27 07:31:47,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:31:47,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:47,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:31:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:31:47,201 INFO L87 Difference]: Start difference. First operand 163553 states and 668264 transitions. Second operand 4 states. [2019-12-27 07:31:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:47,414 INFO L93 Difference]: Finished difference Result 47936 states and 164340 transitions. [2019-12-27 07:31:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:31:47,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 07:31:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:47,480 INFO L225 Difference]: With dead ends: 47936 [2019-12-27 07:31:47,481 INFO L226 Difference]: Without dead ends: 37198 [2019-12-27 07:31:47,481 INFO L631 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 [2019-12-27 07:31:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37198 states. [2019-12-27 07:31:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37198 to 36765. [2019-12-27 07:31:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36765 states. [2019-12-27 07:31:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36765 states to 36765 states and 121273 transitions. [2019-12-27 07:31:48,085 INFO L78 Accepts]: Start accepts. Automaton has 36765 states and 121273 transitions. Word has length 19 [2019-12-27 07:31:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:48,086 INFO L462 AbstractCegarLoop]: Abstraction has 36765 states and 121273 transitions. [2019-12-27 07:31:48,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:31:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 36765 states and 121273 transitions. [2019-12-27 07:31:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:31:48,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:48,092 INFO L411 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] [2019-12-27 07:31:48,093 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -299881963, now seen corresponding path program 1 times [2019-12-27 07:31:48,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:48,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910235063] [2019-12-27 07:31:48,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:48,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910235063] [2019-12-27 07:31:48,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:48,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:31:48,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156190032] [2019-12-27 07:31:48,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:31:48,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:31:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:31:48,179 INFO L87 Difference]: Start difference. First operand 36765 states and 121273 transitions. Second operand 5 states. [2019-12-27 07:31:50,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:50,884 INFO L93 Difference]: Finished difference Result 49671 states and 160913 transitions. [2019-12-27 07:31:50,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:31:50,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:31:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:50,983 INFO L225 Difference]: With dead ends: 49671 [2019-12-27 07:31:50,983 INFO L226 Difference]: Without dead ends: 49369 [2019-12-27 07:31:50,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:31:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49369 states. [2019-12-27 07:31:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49369 to 37450. [2019-12-27 07:31:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37450 states. [2019-12-27 07:31:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37450 states to 37450 states and 123479 transitions. [2019-12-27 07:31:51,706 INFO L78 Accepts]: Start accepts. Automaton has 37450 states and 123479 transitions. Word has length 22 [2019-12-27 07:31:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:51,706 INFO L462 AbstractCegarLoop]: Abstraction has 37450 states and 123479 transitions. [2019-12-27 07:31:51,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:31:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 37450 states and 123479 transitions. [2019-12-27 07:31:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 07:31:51,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:51,714 INFO L411 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] [2019-12-27 07:31:51,715 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -863346088, now seen corresponding path program 1 times [2019-12-27 07:31:51,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:51,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771806709] [2019-12-27 07:31:51,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:51,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771806709] [2019-12-27 07:31:51,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:51,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:31:51,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505899484] [2019-12-27 07:31:51,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:31:51,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:51,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:31:51,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:31:51,805 INFO L87 Difference]: Start difference. First operand 37450 states and 123479 transitions. Second operand 5 states. [2019-12-27 07:31:52,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:52,436 INFO L93 Difference]: Finished difference Result 49503 states and 160288 transitions. [2019-12-27 07:31:52,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:31:52,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 07:31:52,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:52,516 INFO L225 Difference]: With dead ends: 49503 [2019-12-27 07:31:52,516 INFO L226 Difference]: Without dead ends: 49103 [2019-12-27 07:31:52,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:31:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49103 states. [2019-12-27 07:31:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49103 to 34856. [2019-12-27 07:31:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34856 states. [2019-12-27 07:31:53,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34856 states to 34856 states and 114857 transitions. [2019-12-27 07:31:53,520 INFO L78 Accepts]: Start accepts. Automaton has 34856 states and 114857 transitions. Word has length 22 [2019-12-27 07:31:53,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:53,520 INFO L462 AbstractCegarLoop]: Abstraction has 34856 states and 114857 transitions. [2019-12-27 07:31:53,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:31:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 34856 states and 114857 transitions. [2019-12-27 07:31:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:31:53,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:53,532 INFO L411 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, 1, 1] [2019-12-27 07:31:53,532 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2029037298, now seen corresponding path program 1 times [2019-12-27 07:31:53,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:53,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690224214] [2019-12-27 07:31:53,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:53,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690224214] [2019-12-27 07:31:53,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:53,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:31:53,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59010193] [2019-12-27 07:31:53,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:31:53,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:53,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:31:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:31:53,612 INFO L87 Difference]: Start difference. First operand 34856 states and 114857 transitions. Second operand 5 states. [2019-12-27 07:31:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:53,748 INFO L93 Difference]: Finished difference Result 15942 states and 48777 transitions. [2019-12-27 07:31:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:31:53,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 07:31:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:53,781 INFO L225 Difference]: With dead ends: 15942 [2019-12-27 07:31:53,781 INFO L226 Difference]: Without dead ends: 13607 [2019-12-27 07:31:53,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:31:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-27 07:31:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 13415. [2019-12-27 07:31:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13415 states. [2019-12-27 07:31:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13415 states to 13415 states and 40748 transitions. [2019-12-27 07:31:54,085 INFO L78 Accepts]: Start accepts. Automaton has 13415 states and 40748 transitions. Word has length 25 [2019-12-27 07:31:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:54,085 INFO L462 AbstractCegarLoop]: Abstraction has 13415 states and 40748 transitions. [2019-12-27 07:31:54,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:31:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13415 states and 40748 transitions. [2019-12-27 07:31:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 07:31:54,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:54,119 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:54,120 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:54,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:54,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1336056649, now seen corresponding path program 1 times [2019-12-27 07:31:54,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:54,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293318301] [2019-12-27 07:31:54,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:54,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293318301] [2019-12-27 07:31:54,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:54,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:31:54,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925708124] [2019-12-27 07:31:54,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:31:54,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:31:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:31:54,208 INFO L87 Difference]: Start difference. First operand 13415 states and 40748 transitions. Second operand 3 states. [2019-12-27 07:31:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:54,295 INFO L93 Difference]: Finished difference Result 20000 states and 61632 transitions. [2019-12-27 07:31:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:31:54,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 07:31:54,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:54,313 INFO L225 Difference]: With dead ends: 20000 [2019-12-27 07:31:54,314 INFO L226 Difference]: Without dead ends: 8644 [2019-12-27 07:31:54,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:31:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8644 states. [2019-12-27 07:31:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8644 to 8566. [2019-12-27 07:31:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8566 states. [2019-12-27 07:31:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8566 states to 8566 states and 25636 transitions. [2019-12-27 07:31:54,457 INFO L78 Accepts]: Start accepts. Automaton has 8566 states and 25636 transitions. Word has length 39 [2019-12-27 07:31:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:54,458 INFO L462 AbstractCegarLoop]: Abstraction has 8566 states and 25636 transitions. [2019-12-27 07:31:54,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:31:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 8566 states and 25636 transitions. [2019-12-27 07:31:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:31:54,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:54,470 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:54,470 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash -210063419, now seen corresponding path program 1 times [2019-12-27 07:31:54,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:54,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792763189] [2019-12-27 07:31:54,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:54,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792763189] [2019-12-27 07:31:54,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:54,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:31:54,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476801898] [2019-12-27 07:31:54,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:31:54,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:31:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:31:54,566 INFO L87 Difference]: Start difference. First operand 8566 states and 25636 transitions. Second operand 6 states. [2019-12-27 07:31:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:55,025 INFO L93 Difference]: Finished difference Result 9109 states and 26825 transitions. [2019-12-27 07:31:55,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:31:55,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 07:31:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:55,047 INFO L225 Difference]: With dead ends: 9109 [2019-12-27 07:31:55,048 INFO L226 Difference]: Without dead ends: 8903 [2019-12-27 07:31:55,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:31:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8903 states. [2019-12-27 07:31:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8903 to 8841. [2019-12-27 07:31:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2019-12-27 07:31:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 26285 transitions. [2019-12-27 07:31:55,456 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 26285 transitions. Word has length 40 [2019-12-27 07:31:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:55,457 INFO L462 AbstractCegarLoop]: Abstraction has 8841 states and 26285 transitions. [2019-12-27 07:31:55,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:31:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 26285 transitions. [2019-12-27 07:31:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:31:55,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:55,477 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:55,478 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash 637219820, now seen corresponding path program 1 times [2019-12-27 07:31:55,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:55,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140714285] [2019-12-27 07:31:55,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:55,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140714285] [2019-12-27 07:31:55,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:55,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:31:55,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890815197] [2019-12-27 07:31:55,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:31:55,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:55,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:31:55,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:31:55,525 INFO L87 Difference]: Start difference. First operand 8841 states and 26285 transitions. Second operand 3 states. [2019-12-27 07:31:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:55,600 INFO L93 Difference]: Finished difference Result 11265 states and 32678 transitions. [2019-12-27 07:31:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:31:55,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 07:31:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:55,621 INFO L225 Difference]: With dead ends: 11265 [2019-12-27 07:31:55,621 INFO L226 Difference]: Without dead ends: 11265 [2019-12-27 07:31:55,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:31:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11265 states. [2019-12-27 07:31:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11265 to 9267. [2019-12-27 07:31:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2019-12-27 07:31:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 27196 transitions. [2019-12-27 07:31:55,793 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 27196 transitions. Word has length 40 [2019-12-27 07:31:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:55,794 INFO L462 AbstractCegarLoop]: Abstraction has 9267 states and 27196 transitions. [2019-12-27 07:31:55,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:31:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 27196 transitions. [2019-12-27 07:31:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 07:31:55,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:55,807 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:55,807 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1917096257, now seen corresponding path program 1 times [2019-12-27 07:31:55,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:55,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370922028] [2019-12-27 07:31:55,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:55,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370922028] [2019-12-27 07:31:55,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:55,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:31:55,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410584165] [2019-12-27 07:31:55,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:31:55,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:31:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:31:55,878 INFO L87 Difference]: Start difference. First operand 9267 states and 27196 transitions. Second operand 3 states. [2019-12-27 07:31:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:55,922 INFO L93 Difference]: Finished difference Result 8801 states and 25321 transitions. [2019-12-27 07:31:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:31:55,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 07:31:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:55,938 INFO L225 Difference]: With dead ends: 8801 [2019-12-27 07:31:55,938 INFO L226 Difference]: Without dead ends: 8801 [2019-12-27 07:31:55,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:31:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8801 states. [2019-12-27 07:31:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8801 to 8801. [2019-12-27 07:31:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8801 states. [2019-12-27 07:31:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8801 states to 8801 states and 25321 transitions. [2019-12-27 07:31:56,067 INFO L78 Accepts]: Start accepts. Automaton has 8801 states and 25321 transitions. Word has length 40 [2019-12-27 07:31:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:56,067 INFO L462 AbstractCegarLoop]: Abstraction has 8801 states and 25321 transitions. [2019-12-27 07:31:56,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:31:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 8801 states and 25321 transitions. [2019-12-27 07:31:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 07:31:56,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:56,076 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:56,076 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1341792848, now seen corresponding path program 1 times [2019-12-27 07:31:56,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:56,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816389827] [2019-12-27 07:31:56,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:56,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816389827] [2019-12-27 07:31:56,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:56,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:31:56,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686794516] [2019-12-27 07:31:56,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:31:56,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:56,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:31:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:31:56,157 INFO L87 Difference]: Start difference. First operand 8801 states and 25321 transitions. Second operand 6 states. [2019-12-27 07:31:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:56,258 INFO L93 Difference]: Finished difference Result 7726 states and 22682 transitions. [2019-12-27 07:31:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:31:56,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 07:31:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:56,269 INFO L225 Difference]: With dead ends: 7726 [2019-12-27 07:31:56,269 INFO L226 Difference]: Without dead ends: 5811 [2019-12-27 07:31:56,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:31:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5811 states. [2019-12-27 07:31:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5811 to 5811. [2019-12-27 07:31:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5811 states. [2019-12-27 07:31:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5811 states to 5811 states and 18315 transitions. [2019-12-27 07:31:56,368 INFO L78 Accepts]: Start accepts. Automaton has 5811 states and 18315 transitions. Word has length 41 [2019-12-27 07:31:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:56,368 INFO L462 AbstractCegarLoop]: Abstraction has 5811 states and 18315 transitions. [2019-12-27 07:31:56,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:31:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5811 states and 18315 transitions. [2019-12-27 07:31:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:31:56,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:56,375 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:56,375 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash -602506042, now seen corresponding path program 1 times [2019-12-27 07:31:56,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:56,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048989337] [2019-12-27 07:31:56,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:56,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048989337] [2019-12-27 07:31:56,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:56,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:31:56,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622836498] [2019-12-27 07:31:56,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:31:56,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:56,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:31:56,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:31:56,501 INFO L87 Difference]: Start difference. First operand 5811 states and 18315 transitions. Second operand 9 states. [2019-12-27 07:31:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:57,453 INFO L93 Difference]: Finished difference Result 11851 states and 36567 transitions. [2019-12-27 07:31:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 07:31:57,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 07:31:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:57,467 INFO L225 Difference]: With dead ends: 11851 [2019-12-27 07:31:57,468 INFO L226 Difference]: Without dead ends: 8451 [2019-12-27 07:31:57,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:31:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8451 states. [2019-12-27 07:31:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8451 to 7923. [2019-12-27 07:31:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7923 states. [2019-12-27 07:31:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7923 states to 7923 states and 24480 transitions. [2019-12-27 07:31:57,599 INFO L78 Accepts]: Start accepts. Automaton has 7923 states and 24480 transitions. Word has length 55 [2019-12-27 07:31:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:57,599 INFO L462 AbstractCegarLoop]: Abstraction has 7923 states and 24480 transitions. [2019-12-27 07:31:57,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:31:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7923 states and 24480 transitions. [2019-12-27 07:31:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:31:57,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:57,609 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:57,609 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -251826678, now seen corresponding path program 2 times [2019-12-27 07:31:57,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:57,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080914548] [2019-12-27 07:31:57,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:57,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080914548] [2019-12-27 07:31:57,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:57,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:31:57,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364613142] [2019-12-27 07:31:57,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:31:57,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:31:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:31:57,769 INFO L87 Difference]: Start difference. First operand 7923 states and 24480 transitions. Second operand 9 states. [2019-12-27 07:31:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:31:58,904 INFO L93 Difference]: Finished difference Result 14232 states and 42620 transitions. [2019-12-27 07:31:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:31:58,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 07:31:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:31:58,925 INFO L225 Difference]: With dead ends: 14232 [2019-12-27 07:31:58,926 INFO L226 Difference]: Without dead ends: 14112 [2019-12-27 07:31:58,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 07:31:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14112 states. [2019-12-27 07:31:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14112 to 11808. [2019-12-27 07:31:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11808 states. [2019-12-27 07:31:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11808 states to 11808 states and 35457 transitions. [2019-12-27 07:31:59,166 INFO L78 Accepts]: Start accepts. Automaton has 11808 states and 35457 transitions. Word has length 55 [2019-12-27 07:31:59,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:31:59,166 INFO L462 AbstractCegarLoop]: Abstraction has 11808 states and 35457 transitions. [2019-12-27 07:31:59,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:31:59,166 INFO L276 IsEmpty]: Start isEmpty. Operand 11808 states and 35457 transitions. [2019-12-27 07:31:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:31:59,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:31:59,184 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:31:59,184 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:31:59,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:31:59,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1901544958, now seen corresponding path program 3 times [2019-12-27 07:31:59,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:31:59,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412021040] [2019-12-27 07:31:59,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:31:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:31:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:31:59,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412021040] [2019-12-27 07:31:59,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:31:59,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:31:59,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212769736] [2019-12-27 07:31:59,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 07:31:59,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:31:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 07:31:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:31:59,432 INFO L87 Difference]: Start difference. First operand 11808 states and 35457 transitions. Second operand 11 states. [2019-12-27 07:32:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:32:00,478 INFO L93 Difference]: Finished difference Result 19865 states and 58633 transitions. [2019-12-27 07:32:00,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 07:32:00,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 07:32:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:32:00,498 INFO L225 Difference]: With dead ends: 19865 [2019-12-27 07:32:00,499 INFO L226 Difference]: Without dead ends: 12651 [2019-12-27 07:32:00,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 07:32:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12651 states. [2019-12-27 07:32:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12651 to 10961. [2019-12-27 07:32:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2019-12-27 07:32:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 32609 transitions. [2019-12-27 07:32:00,667 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 32609 transitions. Word has length 55 [2019-12-27 07:32:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:32:00,668 INFO L462 AbstractCegarLoop]: Abstraction has 10961 states and 32609 transitions. [2019-12-27 07:32:00,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 07:32:00,668 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 32609 transitions. [2019-12-27 07:32:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:32:00,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:32:00,684 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:32:00,685 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:32:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:32:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1537146070, now seen corresponding path program 4 times [2019-12-27 07:32:00,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:32:00,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186474713] [2019-12-27 07:32:00,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:32:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:32:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:32:00,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186474713] [2019-12-27 07:32:00,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:32:00,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:32:00,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974773301] [2019-12-27 07:32:00,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:32:00,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:32:00,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:32:00,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:32:00,815 INFO L87 Difference]: Start difference. First operand 10961 states and 32609 transitions. Second operand 9 states. [2019-12-27 07:32:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:32:02,265 INFO L93 Difference]: Finished difference Result 20869 states and 60412 transitions. [2019-12-27 07:32:02,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 07:32:02,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 07:32:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:32:02,292 INFO L225 Difference]: With dead ends: 20869 [2019-12-27 07:32:02,293 INFO L226 Difference]: Without dead ends: 20665 [2019-12-27 07:32:02,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-27 07:32:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20665 states. [2019-12-27 07:32:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20665 to 12866. [2019-12-27 07:32:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12866 states. [2019-12-27 07:32:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12866 states to 12866 states and 38420 transitions. [2019-12-27 07:32:02,522 INFO L78 Accepts]: Start accepts. Automaton has 12866 states and 38420 transitions. Word has length 55 [2019-12-27 07:32:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:32:02,522 INFO L462 AbstractCegarLoop]: Abstraction has 12866 states and 38420 transitions. [2019-12-27 07:32:02,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:32:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12866 states and 38420 transitions. [2019-12-27 07:32:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 07:32:02,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:32:02,536 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:32:02,536 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:32:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:32:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1804597976, now seen corresponding path program 5 times [2019-12-27 07:32:02,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:32:02,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353541806] [2019-12-27 07:32:02,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:32:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:32:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:32:02,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353541806] [2019-12-27 07:32:02,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:32:02,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:32:02,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686725640] [2019-12-27 07:32:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:32:02,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:32:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:32:02,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:32:02,607 INFO L87 Difference]: Start difference. First operand 12866 states and 38420 transitions. Second operand 3 states. [2019-12-27 07:32:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:32:02,665 INFO L93 Difference]: Finished difference Result 12864 states and 38415 transitions. [2019-12-27 07:32:02,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:32:02,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 07:32:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:32:02,688 INFO L225 Difference]: With dead ends: 12864 [2019-12-27 07:32:02,688 INFO L226 Difference]: Without dead ends: 12864 [2019-12-27 07:32:02,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:32:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-27 07:32:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 10397. [2019-12-27 07:32:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-12-27 07:32:03,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 31483 transitions. [2019-12-27 07:32:03,085 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 31483 transitions. Word has length 55 [2019-12-27 07:32:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:32:03,086 INFO L462 AbstractCegarLoop]: Abstraction has 10397 states and 31483 transitions. [2019-12-27 07:32:03,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:32:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 31483 transitions. [2019-12-27 07:32:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:32:03,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:32:03,102 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:32:03,102 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:32:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:32:03,102 INFO L82 PathProgramCache]: Analyzing trace with hash 625469602, now seen corresponding path program 1 times [2019-12-27 07:32:03,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:32:03,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018296434] [2019-12-27 07:32:03,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:32:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:32:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:32:03,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018296434] [2019-12-27 07:32:03,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:32:03,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:32:03,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063312270] [2019-12-27 07:32:03,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:32:03,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:32:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:32:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:32:03,701 INFO L87 Difference]: Start difference. First operand 10397 states and 31483 transitions. Second operand 15 states. [2019-12-27 07:32:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:32:06,803 INFO L93 Difference]: Finished difference Result 12446 states and 36812 transitions. [2019-12-27 07:32:06,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 07:32:06,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 07:32:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:32:06,826 INFO L225 Difference]: With dead ends: 12446 [2019-12-27 07:32:06,826 INFO L226 Difference]: Without dead ends: 11840 [2019-12-27 07:32:06,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=465, Invalid=2397, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 07:32:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11840 states. [2019-12-27 07:32:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11840 to 10350. [2019-12-27 07:32:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10350 states. [2019-12-27 07:32:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10350 states to 10350 states and 31389 transitions. [2019-12-27 07:32:07,069 INFO L78 Accepts]: Start accepts. Automaton has 10350 states and 31389 transitions. Word has length 56 [2019-12-27 07:32:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:32:07,070 INFO L462 AbstractCegarLoop]: Abstraction has 10350 states and 31389 transitions. [2019-12-27 07:32:07,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:32:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10350 states and 31389 transitions. [2019-12-27 07:32:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 07:32:07,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:32:07,086 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:32:07,087 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:32:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:32:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2002078782, now seen corresponding path program 2 times [2019-12-27 07:32:07,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:32:07,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661828163] [2019-12-27 07:32:07,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:32:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:32:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:32:07,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:32:07,259 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:32:07,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$w_buff1~0_24) (= 0 v_~x$read_delayed_var~0.offset_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1897~0.base_22|) 0) (= 0 v_~x$r_buff0_thd1~0_73) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= 0 |v_ULTIMATE.start_main_~#t1897~0.offset_18|) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$r_buff0_thd0~0_22) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1897~0.base_22| 1)) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~x$r_buff1_thd2~0_18 0) (= v_~x$flush_delayed~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (< 0 |v_#StackHeapBarrier_17|) (= v_~x~0_23 0) (= v_~x$w_buff1_used~0_67 0) (= v_~y~0_16 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1897~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1897~0.base_22|) |v_ULTIMATE.start_main_~#t1897~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$w_buff0_used~0_113) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1897~0.base_22|) (= v_~x$mem_tmp~0_10 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1897~0.base_22| 4)) (= v_~x$r_buff1_thd0~0_20 0) (= 0 v_~x$r_buff0_thd3~0_20) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~weak$$choice0~0_6) (= 0 v_~x$w_buff0~0_30) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ULTIMATE.start_main_~#t1899~0.base=|v_ULTIMATE.start_main_~#t1899~0.base_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ULTIMATE.start_main_~#t1898~0.base=|v_ULTIMATE.start_main_~#t1898~0.base_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ULTIMATE.start_main_~#t1897~0.offset=|v_ULTIMATE.start_main_~#t1897~0.offset_18|, ULTIMATE.start_main_~#t1897~0.base=|v_ULTIMATE.start_main_~#t1897~0.base_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y~0=v_~y~0_16, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t1898~0.offset=|v_ULTIMATE.start_main_~#t1898~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1899~0.offset=|v_ULTIMATE.start_main_~#t1899~0.offset_14|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1897~0.offset, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1897~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1899~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1898~0.base, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1898~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t1899~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:32:07,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1898~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1898~0.base_10|) |v_ULTIMATE.start_main_~#t1898~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1898~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1898~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1898~0.base_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1898~0.base_10| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1898~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1898~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1898~0.base=|v_ULTIMATE.start_main_~#t1898~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t1898~0.offset=|v_ULTIMATE.start_main_~#t1898~0.offset_9|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1898~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1898~0.offset, #length] because there is no mapped edge [2019-12-27 07:32:07,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= 1 v_~x$w_buff0_used~0_68) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_12) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~x$w_buff1_used~0_40 256)) (= v_~x$w_buff1_used~0_40 v_~x$w_buff0_used~0_69) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_12, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 07:32:07,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1899~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1899~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1899~0.base_11|) |v_ULTIMATE.start_main_~#t1899~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1899~0.base_11|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1899~0.base_11| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1899~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1899~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1899~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1899~0.base=|v_ULTIMATE.start_main_~#t1899~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1899~0.offset=|v_ULTIMATE.start_main_~#t1899~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1899~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1899~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:32:07,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In618477891 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In618477891 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out618477891| ~x~0_In618477891) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In618477891 |P2Thread1of1ForFork1_#t~ite32_Out618477891|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In618477891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In618477891, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In618477891, ~x~0=~x~0_In618477891} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out618477891|, ~x$w_buff1~0=~x$w_buff1~0_In618477891, ~x$w_buff1_used~0=~x$w_buff1_used~0_In618477891, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In618477891, ~x~0=~x~0_In618477891} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:32:07,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:32:07,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In200770161 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In200770161 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In200770161 |P2Thread1of1ForFork1_#t~ite34_Out200770161|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out200770161|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In200770161, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200770161} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out200770161|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In200770161, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200770161} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:32:07,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-236225299 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-236225299 256) 0))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-236225299 256))) (and (= 0 (mod ~x$w_buff1_used~0_In-236225299 256)) .cse0) (= (mod ~x$w_buff0_used~0_In-236225299 256) 0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite9_Out-236225299| |P0Thread1of1ForFork2_#t~ite8_Out-236225299|) (= ~x$w_buff0~0_In-236225299 |P0Thread1of1ForFork2_#t~ite8_Out-236225299|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite8_In-236225299| |P0Thread1of1ForFork2_#t~ite8_Out-236225299|) (= ~x$w_buff0~0_In-236225299 |P0Thread1of1ForFork2_#t~ite9_Out-236225299|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-236225299, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-236225299, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-236225299|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-236225299, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-236225299, ~weak$$choice2~0=~weak$$choice2~0_In-236225299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-236225299} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-236225299, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-236225299, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-236225299|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-236225299, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-236225299|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-236225299, ~weak$$choice2~0=~weak$$choice2~0_In-236225299, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-236225299} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 07:32:07,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1453961595 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1453961595 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out1453961595| 0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out1453961595| ~x$w_buff0_used~0_In1453961595) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1453961595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453961595} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1453961595, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1453961595|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1453961595} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 07:32:07,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1754538659 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1754538659 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1754538659 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1754538659 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out1754538659| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out1754538659| ~x$w_buff1_used~0_In1754538659) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1754538659, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1754538659, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1754538659, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1754538659} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1754538659, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1754538659, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1754538659, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1754538659|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1754538659} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 07:32:07,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1219196640 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1219196640 256)))) (or (and (= ~x$r_buff0_thd2~0_Out1219196640 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1219196640 ~x$r_buff0_thd2~0_Out1219196640)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1219196640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1219196640} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1219196640|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1219196640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1219196640} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:32:07,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-999425425 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-999425425 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-999425425 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-999425425 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-999425425| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-999425425| ~x$r_buff1_thd2~0_In-999425425)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-999425425, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-999425425, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-999425425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-999425425} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-999425425|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-999425425, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-999425425, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-999425425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-999425425} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 07:32:07,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 07:32:07,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-527044027 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-527044027 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-527044027 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-527044027 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-527044027| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-527044027| ~x$w_buff1_used~0_In-527044027) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-527044027, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-527044027, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-527044027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-527044027} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-527044027|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-527044027, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-527044027, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-527044027, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-527044027} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:32:07,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-901841187 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-901841187 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-901841187|)) (and (= ~x$r_buff0_thd3~0_In-901841187 |P2Thread1of1ForFork1_#t~ite36_Out-901841187|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-901841187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-901841187} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-901841187|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-901841187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-901841187} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:32:07,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1488398203 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_In1488398203| |P0Thread1of1ForFork2_#t~ite17_Out1488398203|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out1488398203| ~x$w_buff1_used~0_In1488398203)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite18_Out1488398203| |P0Thread1of1ForFork2_#t~ite17_Out1488398203|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1488398203 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1488398203 256)) .cse1) (and .cse1 (= (mod ~x$w_buff1_used~0_In1488398203 256) 0)) (= (mod ~x$w_buff0_used~0_In1488398203 256) 0))) (= ~x$w_buff1_used~0_In1488398203 |P0Thread1of1ForFork2_#t~ite17_Out1488398203|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1488398203, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1488398203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1488398203, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1488398203, ~weak$$choice2~0=~weak$$choice2~0_In1488398203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488398203} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1488398203, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1488398203|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1488398203|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1488398203, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1488398203, ~weak$$choice2~0=~weak$$choice2~0_In1488398203, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1488398203} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:32:07,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_56 v_~x$r_buff0_thd1~0_55) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 07:32:07,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse4 (= 0 (mod ~x$r_buff1_thd1~0_In439999874 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In439999874 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In439999874 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In439999874 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out439999874| |P0Thread1of1ForFork2_#t~ite23_Out439999874|)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In439999874 256)))) (or (and (or (and (= ~x$r_buff1_thd1~0_In439999874 |P0Thread1of1ForFork2_#t~ite24_Out439999874|) (= |P0Thread1of1ForFork2_#t~ite23_In439999874| |P0Thread1of1ForFork2_#t~ite23_Out439999874|) (not .cse0)) (and .cse0 (= ~x$r_buff1_thd1~0_In439999874 |P0Thread1of1ForFork2_#t~ite23_Out439999874|) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2)) .cse5)) (= |P0Thread1of1ForFork2_#t~ite22_In439999874| |P0Thread1of1ForFork2_#t~ite22_Out439999874|)) (let ((.cse6 (not .cse2))) (and (= |P0Thread1of1ForFork2_#t~ite22_Out439999874| 0) (or (not .cse4) .cse6) .cse0 (not .cse3) (or (not .cse1) .cse6) .cse5 (= |P0Thread1of1ForFork2_#t~ite22_Out439999874| |P0Thread1of1ForFork2_#t~ite23_Out439999874|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439999874, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439999874, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439999874, ~weak$$choice2~0=~weak$$choice2~0_In439999874, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In439999874|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In439999874|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439999874} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439999874, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439999874, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439999874, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out439999874|, ~weak$$choice2~0=~weak$$choice2~0_In439999874, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out439999874|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out439999874|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439999874} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 07:32:07,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1673203643 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1673203643 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1673203643 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-1673203643 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1673203643|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1673203643| ~x$r_buff1_thd3~0_In-1673203643) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1673203643, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1673203643, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1673203643, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673203643} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1673203643|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1673203643, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1673203643, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1673203643, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673203643} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:32:07,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 07:32:07,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 07:32:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:32:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1945871540 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1945871540 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-1945871540 |ULTIMATE.start_main_#t~ite41_Out-1945871540|)) (and (= |ULTIMATE.start_main_#t~ite41_Out-1945871540| ~x~0_In-1945871540) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1945871540, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1945871540, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1945871540, ~x~0=~x~0_In-1945871540} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1945871540|, ~x$w_buff1~0=~x$w_buff1~0_In-1945871540, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1945871540, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1945871540, ~x~0=~x~0_In-1945871540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 07:32:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 07:32:07,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1933451112 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1933451112 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1933451112| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1933451112| ~x$w_buff0_used~0_In1933451112)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1933451112, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1933451112} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1933451112, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1933451112|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1933451112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:32:07,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In2136874859 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In2136874859 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In2136874859 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2136874859 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out2136874859|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In2136874859 |ULTIMATE.start_main_#t~ite44_Out2136874859|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2136874859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2136874859, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2136874859, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136874859} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2136874859, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2136874859, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2136874859, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2136874859|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136874859} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:32:07,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1383595819 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1383595819 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1383595819| ~x$r_buff0_thd0~0_In1383595819)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1383595819|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1383595819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1383595819} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1383595819, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1383595819|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1383595819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:32:07,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In788690208 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In788690208 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In788690208 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In788690208 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out788690208|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In788690208 |ULTIMATE.start_main_#t~ite46_Out788690208|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788690208, ~x$w_buff1_used~0=~x$w_buff1_used~0_In788690208, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In788690208, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788690208} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788690208, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out788690208|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In788690208, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In788690208, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788690208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 07:32:07,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_11 2) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_12|) (= v_~__unbuffered_p2_EBX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:32:07,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:32:07 BasicIcfg [2019-12-27 07:32:07,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:32:07,404 INFO L168 Benchmark]: Toolchain (without parser) took 160720.82 ms. Allocated memory was 139.5 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 102.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 07:32:07,404 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 07:32:07,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.19 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:32:07,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:32:07,406 INFO L168 Benchmark]: Boogie Preprocessor took 42.29 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:32:07,409 INFO L168 Benchmark]: RCFGBuilder took 884.73 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 106.5 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:32:07,409 INFO L168 Benchmark]: TraceAbstraction took 159017.10 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 07:32:07,415 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 711.19 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 101.9 MB in the beginning and 157.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 203.9 MB. Free memory was 157.7 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.29 ms. Allocated memory is still 203.9 MB. Free memory was 155.2 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 884.73 ms. Allocated memory is still 203.9 MB. Free memory was 152.6 MB in the beginning and 106.5 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159017.10 ms. Allocated memory was 203.9 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.8 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 6606 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 69182 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1897, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1898, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1899, ((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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 158.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3506 SDtfs, 4963 SDslu, 9756 SDs, 0 SdLazy, 6914 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163553occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 92.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 166384 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 149476 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...