/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/mix039_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:24:21,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:24:21,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:24:21,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:24:21,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:24:21,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:24:21,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:24:21,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:24:21,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:24:21,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:24:21,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:24:21,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:24:21,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:24:21,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:24:21,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:24:21,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:24:21,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:24:21,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:24:21,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:24:21,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:24:21,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:24:21,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:24:21,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:24:21,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:24:21,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:24:21,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:24:21,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:24:21,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:24:21,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:24:21,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:24:21,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:24:21,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:24:21,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:24:21,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:24:21,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:24:21,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:24:21,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:24:21,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:24:21,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:24:21,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:24:21,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:24:21,629 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 06:24:21,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:24:21,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:24:21,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:24:21,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:24:21,653 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:24:21,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:24:21,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:24:21,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:24:21,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:24:21,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:24:21,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:24:21,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:24:21,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:24:21,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:24:21,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:24:21,656 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:24:21,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:24:21,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:24:21,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:24:21,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:24:21,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:24:21,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:24:21,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:24:21,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:24:21,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:24:21,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:24:21,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:24:21,661 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:24:21,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:24:21,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:24:21,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:24:21,965 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:24:21,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:24:21,969 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:24:21,970 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:24:21,971 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_pso.opt.i [2019-12-27 06:24:22,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e9ad760/1afa643bb0c649799bee88583e655a70/FLAG2e532975e [2019-12-27 06:24:22,567 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:24:22,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_pso.opt.i [2019-12-27 06:24:22,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e9ad760/1afa643bb0c649799bee88583e655a70/FLAG2e532975e [2019-12-27 06:24:22,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e9ad760/1afa643bb0c649799bee88583e655a70 [2019-12-27 06:24:22,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:24:22,829 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:24:22,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:24:22,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:24:22,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:24:22,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:24:22" (1/1) ... [2019-12-27 06:24:22,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e11d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:22, skipping insertion in model container [2019-12-27 06:24:22,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:24:22" (1/1) ... [2019-12-27 06:24:22,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:24:22,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:24:23,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:24:23,398 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:24:23,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:24:23,538 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:24:23,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23 WrapperNode [2019-12-27 06:24:23,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:24:23,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:24:23,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:24:23,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:24:23,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:24:23,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:24:23,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:24:23,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:24:23,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (1/1) ... [2019-12-27 06:24:23,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:24:23,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:24:23,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:24:23,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:24:23,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (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 06:24:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:24:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:24:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:24:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:24:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:24:23,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:24:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:24:23,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:24:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:24:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:24:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:24:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:24:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:24:23,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:24:23,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:24:23,711 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 06:24:24,417 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:24:24,418 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:24:24,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:24:24 BoogieIcfgContainer [2019-12-27 06:24:24,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:24:24,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:24:24,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:24:24,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:24:24,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:24:22" (1/3) ... [2019-12-27 06:24:24,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b8cad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:24:24, skipping insertion in model container [2019-12-27 06:24:24,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:24:23" (2/3) ... [2019-12-27 06:24:24,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b8cad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:24:24, skipping insertion in model container [2019-12-27 06:24:24,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:24:24" (3/3) ... [2019-12-27 06:24:24,429 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_pso.opt.i [2019-12-27 06:24:24,440 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:24:24,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:24:24,449 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:24:24,450 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:24:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,492 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,492 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,494 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,521 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,521 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,521 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,522 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,522 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,540 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,544 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,544 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,544 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,544 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,544 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,554 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,559 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,559 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,563 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,564 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:24:24,578 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:24:24,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:24:24,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:24:24,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:24:24,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:24:24,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:24:24,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:24:24,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:24:24,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:24:24,615 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 06:24:24,617 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 06:24:24,710 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 06:24:24,710 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:24:24,728 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:24:24,749 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 06:24:24,838 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 06:24:24,838 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:24:24,845 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:24:24,860 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 06:24:24,861 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:24:28,794 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 06:24:28,943 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 06:24:28,959 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-27 06:24:28,959 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 06:24:28,962 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-27 06:24:30,269 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-27 06:24:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-27 06:24:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:24:30,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:30,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:30,280 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:30,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-27 06:24:30,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:30,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090422463] [2019-12-27 06:24:30,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:30,635 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 06:24:30,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090422463] [2019-12-27 06:24:30,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:30,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:24:30,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948455710] [2019-12-27 06:24:30,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:30,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:30,664 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-27 06:24:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:31,047 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-27 06:24:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:31,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:24:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:31,242 INFO L225 Difference]: With dead ends: 21750 [2019-12-27 06:24:31,243 INFO L226 Difference]: Without dead ends: 20406 [2019-12-27 06:24:31,244 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 06:24:32,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-27 06:24:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-27 06:24:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:24:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-27 06:24:33,408 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-27 06:24:33,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:33,409 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-27 06:24:33,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:33,410 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-27 06:24:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:24:33,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:33,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:24:33,417 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:33,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-27 06:24:33,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:33,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435266969] [2019-12-27 06:24:33,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:33,549 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 06:24:33,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435266969] [2019-12-27 06:24:33,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:33,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:33,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348641339] [2019-12-27 06:24:33,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:33,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:33,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:33,553 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-27 06:24:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:34,007 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-27 06:24:34,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:34,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:24:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:34,126 INFO L225 Difference]: With dead ends: 31694 [2019-12-27 06:24:34,126 INFO L226 Difference]: Without dead ends: 31634 [2019-12-27 06:24:34,127 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 06:24:35,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-27 06:24:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-27 06:24:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-27 06:24:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-27 06:24:36,681 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-27 06:24:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:36,681 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-27 06:24:36,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-27 06:24:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:24:36,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:36,697 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 06:24:36,698 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:36,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-27 06:24:36,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:36,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334731315] [2019-12-27 06:24:36,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:36,893 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 06:24:36,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334731315] [2019-12-27 06:24:36,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:36,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:36,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955037650] [2019-12-27 06:24:36,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:36,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:36,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:36,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:36,896 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 4 states. [2019-12-27 06:24:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:37,656 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-27 06:24:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:37,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:24:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:37,799 INFO L225 Difference]: With dead ends: 35982 [2019-12-27 06:24:37,800 INFO L226 Difference]: Without dead ends: 35934 [2019-12-27 06:24:37,800 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 06:24:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-27 06:24:38,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-27 06:24:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-27 06:24:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-27 06:24:39,033 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-27 06:24:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:39,033 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-27 06:24:39,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-27 06:24:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 06:24:39,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:39,044 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] [2019-12-27 06:24:39,045 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-27 06:24:39,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:39,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184589144] [2019-12-27 06:24:39,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:39,102 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 06:24:39,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184589144] [2019-12-27 06:24:39,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:39,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:24:39,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358768574] [2019-12-27 06:24:39,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:39,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:39,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:39,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:39,105 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-27 06:24:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:40,563 INFO L93 Difference]: Finished difference Result 30694 states and 128328 transitions. [2019-12-27 06:24:40,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:40,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 06:24:40,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:40,644 INFO L225 Difference]: With dead ends: 30694 [2019-12-27 06:24:40,644 INFO L226 Difference]: Without dead ends: 30694 [2019-12-27 06:24:40,644 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 06:24:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30694 states. [2019-12-27 06:24:41,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30694 to 30694. [2019-12-27 06:24:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30694 states. [2019-12-27 06:24:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30694 states to 30694 states and 128328 transitions. [2019-12-27 06:24:41,449 INFO L78 Accepts]: Start accepts. Automaton has 30694 states and 128328 transitions. Word has length 20 [2019-12-27 06:24:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:41,450 INFO L462 AbstractCegarLoop]: Abstraction has 30694 states and 128328 transitions. [2019-12-27 06:24:41,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 30694 states and 128328 transitions. [2019-12-27 06:24:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:24:41,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:41,463 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] [2019-12-27 06:24:41,463 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash 831760779, now seen corresponding path program 1 times [2019-12-27 06:24:41,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:41,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762190532] [2019-12-27 06:24:41,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:41,557 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 06:24:41,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762190532] [2019-12-27 06:24:41,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:41,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:24:41,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968692896] [2019-12-27 06:24:41,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:41,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:41,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:41,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:41,560 INFO L87 Difference]: Start difference. First operand 30694 states and 128328 transitions. Second operand 3 states. [2019-12-27 06:24:41,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:41,738 INFO L93 Difference]: Finished difference Result 30650 states and 128132 transitions. [2019-12-27 06:24:41,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:41,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 06:24:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:42,164 INFO L225 Difference]: With dead ends: 30650 [2019-12-27 06:24:42,164 INFO L226 Difference]: Without dead ends: 30650 [2019-12-27 06:24:42,164 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 06:24:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30650 states. [2019-12-27 06:24:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30650 to 30650. [2019-12-27 06:24:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30650 states. [2019-12-27 06:24:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30650 states to 30650 states and 128132 transitions. [2019-12-27 06:24:44,586 INFO L78 Accepts]: Start accepts. Automaton has 30650 states and 128132 transitions. Word has length 21 [2019-12-27 06:24:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:44,586 INFO L462 AbstractCegarLoop]: Abstraction has 30650 states and 128132 transitions. [2019-12-27 06:24:44,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 30650 states and 128132 transitions. [2019-12-27 06:24:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:24:44,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:44,599 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 06:24:44,599 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-27 06:24:44,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:44,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261582341] [2019-12-27 06:24:44,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:44,646 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 06:24:44,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261582341] [2019-12-27 06:24:44,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:44,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:44,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345129398] [2019-12-27 06:24:44,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:44,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:44,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:44,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:44,649 INFO L87 Difference]: Start difference. First operand 30650 states and 128132 transitions. Second operand 3 states. [2019-12-27 06:24:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:44,860 INFO L93 Difference]: Finished difference Result 45416 states and 181621 transitions. [2019-12-27 06:24:44,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:44,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 06:24:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:44,936 INFO L225 Difference]: With dead ends: 45416 [2019-12-27 06:24:44,936 INFO L226 Difference]: Without dead ends: 32472 [2019-12-27 06:24:44,937 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 06:24:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2019-12-27 06:24:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 31184. [2019-12-27 06:24:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31184 states. [2019-12-27 06:24:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31184 states to 31184 states and 116749 transitions. [2019-12-27 06:24:45,768 INFO L78 Accepts]: Start accepts. Automaton has 31184 states and 116749 transitions. Word has length 22 [2019-12-27 06:24:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:45,769 INFO L462 AbstractCegarLoop]: Abstraction has 31184 states and 116749 transitions. [2019-12-27 06:24:45,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 31184 states and 116749 transitions. [2019-12-27 06:24:45,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:24:45,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:45,781 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 06:24:45,781 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:45,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:45,781 INFO L82 PathProgramCache]: Analyzing trace with hash 469546711, now seen corresponding path program 1 times [2019-12-27 06:24:45,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:45,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444791152] [2019-12-27 06:24:45,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:45,861 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 06:24:45,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444791152] [2019-12-27 06:24:45,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:45,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:24:45,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145347092] [2019-12-27 06:24:45,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:45,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:45,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:45,863 INFO L87 Difference]: Start difference. First operand 31184 states and 116749 transitions. Second operand 3 states. [2019-12-27 06:24:46,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:46,005 INFO L93 Difference]: Finished difference Result 31184 states and 115357 transitions. [2019-12-27 06:24:46,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:46,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 06:24:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:46,069 INFO L225 Difference]: With dead ends: 31184 [2019-12-27 06:24:46,069 INFO L226 Difference]: Without dead ends: 31184 [2019-12-27 06:24:46,071 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 06:24:46,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31184 states. [2019-12-27 06:24:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31184 to 30784. [2019-12-27 06:24:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30784 states. [2019-12-27 06:24:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30784 states to 30784 states and 113997 transitions. [2019-12-27 06:24:46,953 INFO L78 Accepts]: Start accepts. Automaton has 30784 states and 113997 transitions. Word has length 22 [2019-12-27 06:24:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:46,953 INFO L462 AbstractCegarLoop]: Abstraction has 30784 states and 113997 transitions. [2019-12-27 06:24:46,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:46,953 INFO L276 IsEmpty]: Start isEmpty. Operand 30784 states and 113997 transitions. [2019-12-27 06:24:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:24:46,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:46,967 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] [2019-12-27 06:24:46,967 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1201021632, now seen corresponding path program 1 times [2019-12-27 06:24:46,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:46,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683875409] [2019-12-27 06:24:46,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:47,052 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 06:24:47,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683875409] [2019-12-27 06:24:47,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:47,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:47,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604998450] [2019-12-27 06:24:47,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:47,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:47,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:47,055 INFO L87 Difference]: Start difference. First operand 30784 states and 113997 transitions. Second operand 4 states. [2019-12-27 06:24:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:47,193 INFO L93 Difference]: Finished difference Result 26303 states and 91404 transitions. [2019-12-27 06:24:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:47,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 06:24:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:47,239 INFO L225 Difference]: With dead ends: 26303 [2019-12-27 06:24:47,239 INFO L226 Difference]: Without dead ends: 24465 [2019-12-27 06:24:47,240 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 06:24:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24465 states. [2019-12-27 06:24:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24465 to 24465. [2019-12-27 06:24:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24465 states. [2019-12-27 06:24:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24465 states to 24465 states and 85880 transitions. [2019-12-27 06:24:47,875 INFO L78 Accepts]: Start accepts. Automaton has 24465 states and 85880 transitions. Word has length 23 [2019-12-27 06:24:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:47,876 INFO L462 AbstractCegarLoop]: Abstraction has 24465 states and 85880 transitions. [2019-12-27 06:24:47,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 24465 states and 85880 transitions. [2019-12-27 06:24:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:24:47,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:47,885 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] [2019-12-27 06:24:47,885 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:47,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1983808268, now seen corresponding path program 1 times [2019-12-27 06:24:47,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:47,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054058450] [2019-12-27 06:24:47,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:47,964 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 06:24:47,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054058450] [2019-12-27 06:24:47,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:47,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:47,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963613534] [2019-12-27 06:24:47,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:24:47,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:24:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:24:47,966 INFO L87 Difference]: Start difference. First operand 24465 states and 85880 transitions. Second operand 5 states. [2019-12-27 06:24:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:48,087 INFO L93 Difference]: Finished difference Result 12353 states and 38253 transitions. [2019-12-27 06:24:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:24:48,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 06:24:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:48,113 INFO L225 Difference]: With dead ends: 12353 [2019-12-27 06:24:48,113 INFO L226 Difference]: Without dead ends: 10902 [2019-12-27 06:24:48,113 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 06:24:48,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10902 states. [2019-12-27 06:24:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10902 to 10902. [2019-12-27 06:24:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10902 states. [2019-12-27 06:24:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10902 states to 10902 states and 33618 transitions. [2019-12-27 06:24:48,356 INFO L78 Accepts]: Start accepts. Automaton has 10902 states and 33618 transitions. Word has length 24 [2019-12-27 06:24:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:48,356 INFO L462 AbstractCegarLoop]: Abstraction has 10902 states and 33618 transitions. [2019-12-27 06:24:48,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:24:48,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10902 states and 33618 transitions. [2019-12-27 06:24:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:24:48,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:48,365 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 06:24:48,365 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:48,365 INFO L82 PathProgramCache]: Analyzing trace with hash 22545008, now seen corresponding path program 1 times [2019-12-27 06:24:48,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:48,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125006142] [2019-12-27 06:24:48,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:48,436 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 06:24:48,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125006142] [2019-12-27 06:24:48,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:48,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:48,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428012286] [2019-12-27 06:24:48,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:48,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:48,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:48,439 INFO L87 Difference]: Start difference. First operand 10902 states and 33618 transitions. Second operand 4 states. [2019-12-27 06:24:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:48,525 INFO L93 Difference]: Finished difference Result 16450 states and 50656 transitions. [2019-12-27 06:24:48,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:48,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:24:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:48,545 INFO L225 Difference]: With dead ends: 16450 [2019-12-27 06:24:48,545 INFO L226 Difference]: Without dead ends: 8773 [2019-12-27 06:24:48,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 06:24:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8773 states. [2019-12-27 06:24:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8773 to 8484. [2019-12-27 06:24:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-12-27 06:24:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 26171 transitions. [2019-12-27 06:24:48,818 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 26171 transitions. Word has length 25 [2019-12-27 06:24:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:48,818 INFO L462 AbstractCegarLoop]: Abstraction has 8484 states and 26171 transitions. [2019-12-27 06:24:48,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 26171 transitions. [2019-12-27 06:24:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:24:48,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:48,822 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 06:24:48,823 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1039706542, now seen corresponding path program 2 times [2019-12-27 06:24:48,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:48,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651815488] [2019-12-27 06:24:48,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:48,866 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 06:24:48,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651815488] [2019-12-27 06:24:48,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:48,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:48,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880573809] [2019-12-27 06:24:48,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:24:48,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:24:48,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:24:48,868 INFO L87 Difference]: Start difference. First operand 8484 states and 26171 transitions. Second operand 4 states. [2019-12-27 06:24:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:48,939 INFO L93 Difference]: Finished difference Result 12593 states and 38979 transitions. [2019-12-27 06:24:48,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:24:48,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:24:48,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:48,951 INFO L225 Difference]: With dead ends: 12593 [2019-12-27 06:24:48,952 INFO L226 Difference]: Without dead ends: 7913 [2019-12-27 06:24:48,952 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 06:24:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7913 states. [2019-12-27 06:24:49,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7913 to 7425. [2019-12-27 06:24:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7425 states. [2019-12-27 06:24:49,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 21851 transitions. [2019-12-27 06:24:49,061 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 21851 transitions. Word has length 25 [2019-12-27 06:24:49,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:49,061 INFO L462 AbstractCegarLoop]: Abstraction has 7425 states and 21851 transitions. [2019-12-27 06:24:49,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:24:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 21851 transitions. [2019-12-27 06:24:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:24:49,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:49,065 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 06:24:49,065 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1222398540, now seen corresponding path program 3 times [2019-12-27 06:24:49,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:49,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169398149] [2019-12-27 06:24:49,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:49,162 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 06:24:49,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169398149] [2019-12-27 06:24:49,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:49,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:24:49,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349010844] [2019-12-27 06:24:49,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:24:49,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:49,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:24:49,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:49,164 INFO L87 Difference]: Start difference. First operand 7425 states and 21851 transitions. Second operand 6 states. [2019-12-27 06:24:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:49,275 INFO L93 Difference]: Finished difference Result 2984 states and 7748 transitions. [2019-12-27 06:24:49,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:24:49,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 06:24:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:49,280 INFO L225 Difference]: With dead ends: 2984 [2019-12-27 06:24:49,281 INFO L226 Difference]: Without dead ends: 2530 [2019-12-27 06:24:49,281 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 06:24:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2530 states. [2019-12-27 06:24:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2530 to 2530. [2019-12-27 06:24:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2530 states. [2019-12-27 06:24:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 6428 transitions. [2019-12-27 06:24:49,329 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 6428 transitions. Word has length 25 [2019-12-27 06:24:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:49,329 INFO L462 AbstractCegarLoop]: Abstraction has 2530 states and 6428 transitions. [2019-12-27 06:24:49,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:24:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 6428 transitions. [2019-12-27 06:24:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:24:49,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:49,335 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] [2019-12-27 06:24:49,336 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:49,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-27 06:24:49,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:49,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566100109] [2019-12-27 06:24:49,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:49,374 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 06:24:49,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566100109] [2019-12-27 06:24:49,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:49,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:24:49,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224799992] [2019-12-27 06:24:49,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:24:49,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:24:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:24:49,376 INFO L87 Difference]: Start difference. First operand 2530 states and 6428 transitions. Second operand 3 states. [2019-12-27 06:24:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:49,442 INFO L93 Difference]: Finished difference Result 3810 states and 9643 transitions. [2019-12-27 06:24:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:24:49,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 06:24:49,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:49,450 INFO L225 Difference]: With dead ends: 3810 [2019-12-27 06:24:49,450 INFO L226 Difference]: Without dead ends: 3810 [2019-12-27 06:24:49,451 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 06:24:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2019-12-27 06:24:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 2986. [2019-12-27 06:24:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-12-27 06:24:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 7669 transitions. [2019-12-27 06:24:49,507 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 7669 transitions. Word has length 32 [2019-12-27 06:24:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:49,507 INFO L462 AbstractCegarLoop]: Abstraction has 2986 states and 7669 transitions. [2019-12-27 06:24:49,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:24:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 7669 transitions. [2019-12-27 06:24:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:24:49,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:49,512 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] [2019-12-27 06:24:49,513 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:49,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:49,513 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-27 06:24:49,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:49,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011264326] [2019-12-27 06:24:49,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:49,591 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 06:24:49,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011264326] [2019-12-27 06:24:49,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:49,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:49,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786459794] [2019-12-27 06:24:49,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:24:49,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:24:49,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:49,593 INFO L87 Difference]: Start difference. First operand 2986 states and 7669 transitions. Second operand 6 states. [2019-12-27 06:24:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:49,954 INFO L93 Difference]: Finished difference Result 5519 states and 13587 transitions. [2019-12-27 06:24:49,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:24:49,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 06:24:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:49,962 INFO L225 Difference]: With dead ends: 5519 [2019-12-27 06:24:49,963 INFO L226 Difference]: Without dead ends: 5336 [2019-12-27 06:24:49,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:24:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2019-12-27 06:24:50,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 3010. [2019-12-27 06:24:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3010 states. [2019-12-27 06:24:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 7675 transitions. [2019-12-27 06:24:50,022 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 7675 transitions. Word has length 32 [2019-12-27 06:24:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:50,022 INFO L462 AbstractCegarLoop]: Abstraction has 3010 states and 7675 transitions. [2019-12-27 06:24:50,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:24:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 7675 transitions. [2019-12-27 06:24:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:24:50,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:50,027 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] [2019-12-27 06:24:50,027 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash 390952001, now seen corresponding path program 1 times [2019-12-27 06:24:50,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:50,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14988126] [2019-12-27 06:24:50,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:50,102 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 06:24:50,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14988126] [2019-12-27 06:24:50,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:50,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:24:50,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757214867] [2019-12-27 06:24:50,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:24:50,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:24:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:24:50,104 INFO L87 Difference]: Start difference. First operand 3010 states and 7675 transitions. Second operand 6 states. [2019-12-27 06:24:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:50,531 INFO L93 Difference]: Finished difference Result 5442 states and 13173 transitions. [2019-12-27 06:24:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:24:50,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:24:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:50,539 INFO L225 Difference]: With dead ends: 5442 [2019-12-27 06:24:50,539 INFO L226 Difference]: Without dead ends: 5244 [2019-12-27 06:24:50,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:24:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2019-12-27 06:24:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 2895. [2019-12-27 06:24:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2895 states. [2019-12-27 06:24:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 7266 transitions. [2019-12-27 06:24:50,583 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 7266 transitions. Word has length 33 [2019-12-27 06:24:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:50,583 INFO L462 AbstractCegarLoop]: Abstraction has 2895 states and 7266 transitions. [2019-12-27 06:24:50,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:24:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 7266 transitions. [2019-12-27 06:24:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:24:50,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:50,586 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] [2019-12-27 06:24:50,587 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1721626467, now seen corresponding path program 1 times [2019-12-27 06:24:50,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:50,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398180591] [2019-12-27 06:24:50,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:50,678 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 06:24:50,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398180591] [2019-12-27 06:24:50,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:50,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:50,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215353027] [2019-12-27 06:24:50,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:50,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:50,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:50,680 INFO L87 Difference]: Start difference. First operand 2895 states and 7266 transitions. Second operand 7 states. [2019-12-27 06:24:50,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:50,795 INFO L93 Difference]: Finished difference Result 2200 states and 5582 transitions. [2019-12-27 06:24:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:24:50,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:24:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:50,796 INFO L225 Difference]: With dead ends: 2200 [2019-12-27 06:24:50,796 INFO L226 Difference]: Without dead ends: 487 [2019-12-27 06:24:50,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:24:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-27 06:24:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2019-12-27 06:24:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 06:24:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1081 transitions. [2019-12-27 06:24:50,804 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1081 transitions. Word has length 34 [2019-12-27 06:24:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:50,804 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1081 transitions. [2019-12-27 06:24:50,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1081 transitions. [2019-12-27 06:24:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:24:50,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:50,806 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] [2019-12-27 06:24:50,806 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:50,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 1 times [2019-12-27 06:24:50,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:50,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045817931] [2019-12-27 06:24:50,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:24:50,895 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 06:24:50,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045817931] [2019-12-27 06:24:50,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:24:50,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:24:50,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235511415] [2019-12-27 06:24:50,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:24:50,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:24:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:24:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:24:50,897 INFO L87 Difference]: Start difference. First operand 481 states and 1081 transitions. Second operand 7 states. [2019-12-27 06:24:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:24:51,046 INFO L93 Difference]: Finished difference Result 912 states and 2005 transitions. [2019-12-27 06:24:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:24:51,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 06:24:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:24:51,047 INFO L225 Difference]: With dead ends: 912 [2019-12-27 06:24:51,047 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 06:24:51,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:24:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 06:24:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 548. [2019-12-27 06:24:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 06:24:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1194 transitions. [2019-12-27 06:24:51,056 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1194 transitions. Word has length 48 [2019-12-27 06:24:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:24:51,057 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1194 transitions. [2019-12-27 06:24:51,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:24:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1194 transitions. [2019-12-27 06:24:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:24:51,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:24:51,059 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] [2019-12-27 06:24:51,059 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:24:51,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:24:51,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 2 times [2019-12-27 06:24:51,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:24:51,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648329975] [2019-12-27 06:24:51,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:24:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:24:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:24:51,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:24:51,280 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:24:51,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= v_~b~0_13 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~y~0_17 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~z$read_delayed~0_6 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_29| 1)) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd3~0_66 0) (= 0 |v_ULTIMATE.start_main_~#t1037~0.offset_22|) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1037~0.base_29|) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1037~0.base_29|)) (= v_~x~0_12 0) (= v_~z~0_20 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1037~0.base_29| 4) |v_#length_29|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1037~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1037~0.base_29|) |v_ULTIMATE.start_main_~#t1037~0.offset_22| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_15|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_23|, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_19|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1037~0.offset=|v_ULTIMATE.start_main_~#t1037~0.offset_22|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t1037~0.base=|v_ULTIMATE.start_main_~#t1037~0.base_29|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_18|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1038~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1039~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1037~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t1040~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1037~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1039~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1038~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:24:51,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1038~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1038~0.base_11|) |v_ULTIMATE.start_main_~#t1038~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1038~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1038~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1038~0.offset_10|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1038~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1038~0.offset=|v_ULTIMATE.start_main_~#t1038~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1038~0.base=|v_ULTIMATE.start_main_~#t1038~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1038~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1038~0.base, #length] because there is no mapped edge [2019-12-27 06:24:51,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1039~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1039~0.offset_11|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1039~0.base_12|) |v_ULTIMATE.start_main_~#t1039~0.offset_11| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1039~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1039~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1039~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1039~0.base=|v_ULTIMATE.start_main_~#t1039~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1039~0.offset=|v_ULTIMATE.start_main_~#t1039~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1039~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1039~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:24:51,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1040~0.base_12|) |v_ULTIMATE.start_main_~#t1040~0.offset_10| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1040~0.base_12|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1040~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1040~0.offset_10| 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1040~0.base_12| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1040~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1040~0.offset=|v_ULTIMATE.start_main_~#t1040~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1040~0.base=|v_ULTIMATE.start_main_~#t1040~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1040~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1040~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:24:51,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (= ~__unbuffered_p3_EBX~0_Out-1413586776 ~b~0_In-1413586776) (= ~z$r_buff0_thd4~0_Out-1413586776 1) (= ~z$r_buff0_thd0~0_In-1413586776 ~z$r_buff1_thd0~0_Out-1413586776) (= ~z$r_buff1_thd1~0_Out-1413586776 ~z$r_buff0_thd1~0_In-1413586776) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1413586776)) (= 1 ~a~0_Out-1413586776) (= ~z$r_buff1_thd3~0_Out-1413586776 ~z$r_buff0_thd3~0_In-1413586776) (= ~z$r_buff1_thd2~0_Out-1413586776 ~z$r_buff0_thd2~0_In-1413586776) (= ~a~0_Out-1413586776 ~__unbuffered_p3_EAX~0_Out-1413586776) (= ~z$r_buff1_thd4~0_Out-1413586776 ~z$r_buff0_thd4~0_In-1413586776)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1413586776, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1413586776, ~b~0=~b~0_In-1413586776, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1413586776, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1413586776, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1413586776, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1413586776} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1413586776, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1413586776, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1413586776, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1413586776, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1413586776, ~a~0=~a~0_Out-1413586776, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1413586776, ~b~0=~b~0_In-1413586776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1413586776, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1413586776, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1413586776, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1413586776, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1413586776, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1413586776, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1413586776} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:24:51,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_8) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 06:24:51,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 1 v_~y~0_8) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_8, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 06:24:51,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2130756519 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In-2130756519 |P2Thread1of1ForFork1_#t~ite9_Out-2130756519|) (= |P2Thread1of1ForFork1_#t~ite8_In-2130756519| |P2Thread1of1ForFork1_#t~ite8_Out-2130756519|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2130756519 256)))) (or (= (mod ~z$w_buff0_used~0_In-2130756519 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-2130756519 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2130756519 256))))) (= |P2Thread1of1ForFork1_#t~ite9_Out-2130756519| |P2Thread1of1ForFork1_#t~ite8_Out-2130756519|) .cse0 (= ~z$w_buff0~0_In-2130756519 |P2Thread1of1ForFork1_#t~ite8_Out-2130756519|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-2130756519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2130756519, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2130756519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2130756519, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2130756519, ~weak$$choice2~0=~weak$$choice2~0_In-2130756519, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-2130756519|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-2130756519, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2130756519, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2130756519, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2130756519, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2130756519, ~weak$$choice2~0=~weak$$choice2~0_In-2130756519, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-2130756519|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-2130756519|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:24:51,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-6161752 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite12_Out-6161752| |P2Thread1of1ForFork1_#t~ite11_Out-6161752|) (= ~z$w_buff1~0_In-6161752 |P2Thread1of1ForFork1_#t~ite11_Out-6161752|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-6161752 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-6161752 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-6161752 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-6161752 256))))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite11_In-6161752| |P2Thread1of1ForFork1_#t~ite11_Out-6161752|) (= ~z$w_buff1~0_In-6161752 |P2Thread1of1ForFork1_#t~ite12_Out-6161752|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-6161752, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-6161752, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-6161752|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-6161752, ~z$w_buff1~0=~z$w_buff1~0_In-6161752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-6161752, ~weak$$choice2~0=~weak$$choice2~0_In-6161752} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-6161752, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-6161752|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-6161752, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-6161752|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-6161752, ~z$w_buff1~0=~z$w_buff1~0_In-6161752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-6161752, ~weak$$choice2~0=~weak$$choice2~0_In-6161752} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:24:51,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1885409057 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite14_In1885409057| |P2Thread1of1ForFork1_#t~ite14_Out1885409057|) (= ~z$w_buff0_used~0_In1885409057 |P2Thread1of1ForFork1_#t~ite15_Out1885409057|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out1885409057| ~z$w_buff0_used~0_In1885409057) (= |P2Thread1of1ForFork1_#t~ite14_Out1885409057| |P2Thread1of1ForFork1_#t~ite15_Out1885409057|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1885409057 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1885409057 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In1885409057 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1885409057 256)))) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1885409057|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885409057, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1885409057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885409057, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1885409057, ~weak$$choice2~0=~weak$$choice2~0_In1885409057} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1885409057|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1885409057|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885409057, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1885409057, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885409057, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1885409057, ~weak$$choice2~0=~weak$$choice2~0_In1885409057} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 06:24:51,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 06:24:51,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In156015110 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_Out156015110| ~z$r_buff1_thd3~0_In156015110) (= |P2Thread1of1ForFork1_#t~ite23_Out156015110| |P2Thread1of1ForFork1_#t~ite24_Out156015110|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In156015110 256) 0))) (or (= (mod ~z$w_buff0_used~0_In156015110 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In156015110 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In156015110 256)))))) (and (= ~z$r_buff1_thd3~0_In156015110 |P2Thread1of1ForFork1_#t~ite24_Out156015110|) (= |P2Thread1of1ForFork1_#t~ite23_In156015110| |P2Thread1of1ForFork1_#t~ite23_Out156015110|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In156015110, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In156015110, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In156015110|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In156015110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In156015110, ~weak$$choice2~0=~weak$$choice2~0_In156015110} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out156015110|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In156015110, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In156015110, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out156015110|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In156015110, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In156015110, ~weak$$choice2~0=~weak$$choice2~0_In156015110} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 06:24:51,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:24:51,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-427778829 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-427778829 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-427778829|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-427778829 |P3Thread1of1ForFork2_#t~ite28_Out-427778829|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-427778829, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-427778829} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-427778829|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-427778829, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-427778829} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 06:24:51,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1546350024 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1546350024 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1546350024 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1546350024 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out-1546350024| 0)) (and (= ~z$w_buff1_used~0_In-1546350024 |P3Thread1of1ForFork2_#t~ite29_Out-1546350024|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1546350024, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1546350024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1546350024, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1546350024} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1546350024|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1546350024, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1546350024, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1546350024, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1546350024} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:24:51,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In5476760 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In5476760 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out5476760 0)) (and (= ~z$r_buff0_thd4~0_In5476760 ~z$r_buff0_thd4~0_Out5476760) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In5476760, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In5476760} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In5476760, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out5476760, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out5476760|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 06:24:51,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-590278304 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-590278304 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-590278304 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-590278304 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out-590278304| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out-590278304| ~z$r_buff1_thd4~0_In-590278304) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-590278304, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-590278304, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-590278304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-590278304} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-590278304, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-590278304, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-590278304, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-590278304, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-590278304|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:24:51,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:24:51,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:24:51,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In2143439657 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2143439657 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite36_Out2143439657| |ULTIMATE.start_main_#t~ite37_Out2143439657|))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite36_Out2143439657| ~z$w_buff1~0_In2143439657)) (and (or .cse2 .cse0) .cse1 (= ~z~0_In2143439657 |ULTIMATE.start_main_#t~ite36_Out2143439657|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2143439657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2143439657, ~z$w_buff1~0=~z$w_buff1~0_In2143439657, ~z~0=~z~0_In2143439657} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2143439657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2143439657, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out2143439657|, ~z$w_buff1~0=~z$w_buff1~0_In2143439657, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2143439657|, ~z~0=~z~0_In2143439657} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:24:51,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1079725750 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1079725750 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1079725750 |ULTIMATE.start_main_#t~ite38_Out1079725750|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out1079725750|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1079725750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1079725750} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1079725750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1079725750, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1079725750|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:24:51,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In993737557 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In993737557 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In993737557 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In993737557 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out993737557|)) (and (= ~z$w_buff1_used~0_In993737557 |ULTIMATE.start_main_#t~ite39_Out993737557|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In993737557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In993737557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In993737557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993737557} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In993737557, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out993737557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In993737557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In993737557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In993737557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:24:51,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1263462063 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1263462063 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1263462063| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1263462063| ~z$r_buff0_thd0~0_In1263462063)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1263462063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1263462063} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1263462063, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1263462063|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1263462063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:24:51,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-119239483 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-119239483 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-119239483 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-119239483 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-119239483|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-119239483 |ULTIMATE.start_main_#t~ite41_Out-119239483|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-119239483, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-119239483, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-119239483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119239483} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-119239483|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-119239483, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-119239483, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-119239483, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-119239483} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:24:51,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~y~0=v_~y~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:24:51,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:24:51 BasicIcfg [2019-12-27 06:24:51,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:24:51,429 INFO L168 Benchmark]: Toolchain (without parser) took 28598.80 ms. Allocated memory was 144.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 99.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 412.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:51,434 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:24:51,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.87 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.0 MB in the beginning and 155.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:51,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:51,435 INFO L168 Benchmark]: Boogie Preprocessor took 46.28 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:51,437 INFO L168 Benchmark]: RCFGBuilder took 771.02 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 104.1 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:51,438 INFO L168 Benchmark]: TraceAbstraction took 27004.44 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 104.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 358.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:24:51,445 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.36 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 708.87 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 99.0 MB in the beginning and 155.6 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.74 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.28 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 771.02 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 104.1 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27004.44 ms. Allocated memory was 202.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 104.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 358.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5608 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1040, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1808 SDtfs, 2623 SDslu, 2901 SDs, 0 SdLazy, 1071 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31184occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 15884 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 476 NumberOfCodeBlocks, 476 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 33075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...