/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:59:27,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:59:27,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:59:27,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:59:27,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:59:27,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:59:27,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:59:27,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:59:27,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:59:27,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:59:27,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:59:27,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:59:27,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:59:27,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:59:27,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:59:27,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:59:27,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:59:27,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:59:27,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:59:27,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:59:27,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:59:27,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:59:27,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:59:27,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:59:27,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:59:27,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:59:27,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:59:27,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:59:27,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:59:27,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:59:27,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:59:27,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:59:27,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:59:27,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:59:27,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:59:27,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:59:27,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:59:27,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:59:27,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:59:27,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:59:27,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:59:27,713 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-MCR.epf [2019-12-27 21:59:27,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:59:27,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:59:27,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:59:27,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:59:27,740 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:59:27,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:59:27,740 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:59:27,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:59:27,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:59:27,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:59:27,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:59:27,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:59:27,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:59:27,743 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:59:27,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:59:27,743 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:59:27,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:59:27,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:59:27,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:59:27,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:59:27,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:59:27,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:59:27,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:59:27,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:59:27,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:59:27,745 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:59:27,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:59:27,745 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:59:27,746 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:59:27,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:59:27,747 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:59:27,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:59:28,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:59:28,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:59:28,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:59:28,028 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:59:28,029 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:59:28,029 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2019-12-27 21:59:28,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b653456/ce50224cca3f43fe8bf7b8edf31b9f51/FLAG8efdd08f7 [2019-12-27 21:59:28,702 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:59:28,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_rmo.oepc.i [2019-12-27 21:59:28,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b653456/ce50224cca3f43fe8bf7b8edf31b9f51/FLAG8efdd08f7 [2019-12-27 21:59:28,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16b653456/ce50224cca3f43fe8bf7b8edf31b9f51 [2019-12-27 21:59:28,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:59:28,919 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:59:28,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:28,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:59:28,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:59:28,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58700a86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:28, skipping insertion in model container [2019-12-27 21:59:28,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:59:28" (1/1) ... [2019-12-27 21:59:28,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:59:28,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:59:29,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:29,466 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:59:29,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:59:29,611 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:59:29,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29 WrapperNode [2019-12-27 21:59:29,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:59:29,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:29,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:59:29,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:59:29,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:59:29,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:59:29,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:59:29,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:59:29,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (1/1) ... [2019-12-27 21:59:29,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:59:29,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:59:29,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:59:29,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:59:29,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (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 21:59:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:59:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:59:29,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:59:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:59:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:59:29,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:59:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:59:29,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:59:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:59:29,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:59:29,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:59:29,769 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 21:59:30,455 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:59:30,455 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:59:30,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:30 BoogieIcfgContainer [2019-12-27 21:59:30,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:59:30,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:59:30,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:59:30,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:59:30,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:59:28" (1/3) ... [2019-12-27 21:59:30,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d96703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:30, skipping insertion in model container [2019-12-27 21:59:30,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:59:29" (2/3) ... [2019-12-27 21:59:30,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d96703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:59:30, skipping insertion in model container [2019-12-27 21:59:30,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:59:30" (3/3) ... [2019-12-27 21:59:30,468 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc.i [2019-12-27 21:59:30,479 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:59:30,480 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:59:30,490 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:59:30,491 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:59:30,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,537 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,538 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,594 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,595 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,596 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,596 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,604 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:59:30,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:59:30,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:59:30,640 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:59:30,640 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:59:30,640 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:59:30,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:59:30,641 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:59:30,641 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:59:30,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:59:30,660 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 21:59:30,662 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:59:30,765 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:59:30,765 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:30,781 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:59:30,800 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 21:59:30,843 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 21:59:30,843 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:59:30,849 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:59:30,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:59:30,865 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:59:33,902 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 21:59:34,017 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 21:59:34,100 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50908 [2019-12-27 21:59:34,100 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 21:59:34,104 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 90 transitions [2019-12-27 21:59:34,627 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9707 states. [2019-12-27 21:59:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states. [2019-12-27 21:59:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:59:34,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:34,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:59:34,637 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:34,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:34,644 INFO L82 PathProgramCache]: Analyzing trace with hash 787412, now seen corresponding path program 1 times [2019-12-27 21:59:34,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:34,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818753305] [2019-12-27 21:59:34,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:34,838 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 21:59:34,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818753305] [2019-12-27 21:59:34,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:34,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:59:34,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845642772] [2019-12-27 21:59:34,842 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:34,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:34,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:59:34,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:34,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:34,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:34,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:34,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:34,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:34,881 INFO L87 Difference]: Start difference. First operand 9707 states. Second operand 3 states. [2019-12-27 21:59:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:35,170 INFO L93 Difference]: Finished difference Result 9421 states and 30351 transitions. [2019-12-27 21:59:35,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:35,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:59:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:35,305 INFO L225 Difference]: With dead ends: 9421 [2019-12-27 21:59:35,305 INFO L226 Difference]: Without dead ends: 8862 [2019-12-27 21:59:35,310 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 21:59:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2019-12-27 21:59:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8862. [2019-12-27 21:59:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-27 21:59:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 28501 transitions. [2019-12-27 21:59:35,867 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 28501 transitions. Word has length 3 [2019-12-27 21:59:35,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:35,868 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 28501 transitions. [2019-12-27 21:59:35,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 28501 transitions. [2019-12-27 21:59:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:59:35,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:35,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:35,872 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1755658876, now seen corresponding path program 1 times [2019-12-27 21:59:35,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:35,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55739264] [2019-12-27 21:59:35,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:36,039 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 21:59:36,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55739264] [2019-12-27 21:59:36,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:36,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:36,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881860793] [2019-12-27 21:59:36,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:36,044 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:36,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:59:36,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:36,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:36,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:36,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:36,053 INFO L87 Difference]: Start difference. First operand 8862 states and 28501 transitions. Second operand 4 states. [2019-12-27 21:59:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:36,541 INFO L93 Difference]: Finished difference Result 13396 states and 41079 transitions. [2019-12-27 21:59:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:36,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:59:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:36,616 INFO L225 Difference]: With dead ends: 13396 [2019-12-27 21:59:36,616 INFO L226 Difference]: Without dead ends: 13389 [2019-12-27 21:59:36,617 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 21:59:36,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2019-12-27 21:59:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 12015. [2019-12-27 21:59:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12015 states. [2019-12-27 21:59:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 37536 transitions. [2019-12-27 21:59:37,755 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 37536 transitions. Word has length 11 [2019-12-27 21:59:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:37,756 INFO L462 AbstractCegarLoop]: Abstraction has 12015 states and 37536 transitions. [2019-12-27 21:59:37,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 37536 transitions. [2019-12-27 21:59:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:59:37,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:37,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:37,762 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:37,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1550555126, now seen corresponding path program 1 times [2019-12-27 21:59:37,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:37,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860623766] [2019-12-27 21:59:37,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:37,882 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 21:59:37,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860623766] [2019-12-27 21:59:37,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:37,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:37,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [658475915] [2019-12-27 21:59:37,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:37,886 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:37,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:59:37,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:37,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:37,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:37,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:37,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:37,890 INFO L87 Difference]: Start difference. First operand 12015 states and 37536 transitions. Second operand 4 states. [2019-12-27 21:59:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:38,149 INFO L93 Difference]: Finished difference Result 14164 states and 44146 transitions. [2019-12-27 21:59:38,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:38,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:59:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:38,203 INFO L225 Difference]: With dead ends: 14164 [2019-12-27 21:59:38,203 INFO L226 Difference]: Without dead ends: 14164 [2019-12-27 21:59:38,204 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 21:59:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14164 states. [2019-12-27 21:59:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14164 to 12676. [2019-12-27 21:59:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12676 states. [2019-12-27 21:59:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12676 states to 12676 states and 39720 transitions. [2019-12-27 21:59:38,838 INFO L78 Accepts]: Start accepts. Automaton has 12676 states and 39720 transitions. Word has length 14 [2019-12-27 21:59:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:38,839 INFO L462 AbstractCegarLoop]: Abstraction has 12676 states and 39720 transitions. [2019-12-27 21:59:38,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 12676 states and 39720 transitions. [2019-12-27 21:59:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:59:38,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:38,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:38,844 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:38,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1838903681, now seen corresponding path program 1 times [2019-12-27 21:59:38,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:38,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439522230] [2019-12-27 21:59:38,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:38,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 21:59:38,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439522230] [2019-12-27 21:59:38,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:38,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:59:38,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [811564132] [2019-12-27 21:59:38,897 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:38,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:38,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 21:59:38,902 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:38,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:38,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:38,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:38,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:38,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:38,905 INFO L87 Difference]: Start difference. First operand 12676 states and 39720 transitions. Second operand 3 states. [2019-12-27 21:59:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:38,979 INFO L93 Difference]: Finished difference Result 12673 states and 39711 transitions. [2019-12-27 21:59:38,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:38,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:59:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:39,022 INFO L225 Difference]: With dead ends: 12673 [2019-12-27 21:59:39,023 INFO L226 Difference]: Without dead ends: 12673 [2019-12-27 21:59:39,023 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 21:59:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2019-12-27 21:59:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 12673. [2019-12-27 21:59:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-27 21:59:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 39711 transitions. [2019-12-27 21:59:39,573 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 39711 transitions. Word has length 16 [2019-12-27 21:59:39,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:39,574 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 39711 transitions. [2019-12-27 21:59:39,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:39,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 39711 transitions. [2019-12-27 21:59:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:59:39,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:39,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:39,581 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:39,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:39,581 INFO L82 PathProgramCache]: Analyzing trace with hash -601685409, now seen corresponding path program 1 times [2019-12-27 21:59:39,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:39,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807040832] [2019-12-27 21:59:39,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:39,656 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 21:59:39,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807040832] [2019-12-27 21:59:39,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:39,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:39,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1426729221] [2019-12-27 21:59:39,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:39,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:39,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:59:39,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:39,665 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:39,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:39,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:39,666 INFO L87 Difference]: Start difference. First operand 12673 states and 39711 transitions. Second operand 3 states. [2019-12-27 21:59:39,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:39,791 INFO L93 Difference]: Finished difference Result 21543 states and 67050 transitions. [2019-12-27 21:59:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:39,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 21:59:39,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:39,830 INFO L225 Difference]: With dead ends: 21543 [2019-12-27 21:59:39,831 INFO L226 Difference]: Without dead ends: 12171 [2019-12-27 21:59:39,831 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 21:59:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-12-27 21:59:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 11475. [2019-12-27 21:59:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-27 21:59:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 34983 transitions. [2019-12-27 21:59:40,887 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 34983 transitions. Word has length 17 [2019-12-27 21:59:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:40,888 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 34983 transitions. [2019-12-27 21:59:40,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 34983 transitions. [2019-12-27 21:59:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:59:40,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:40,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:40,897 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:40,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1176802527, now seen corresponding path program 1 times [2019-12-27 21:59:40,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:40,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293378930] [2019-12-27 21:59:40,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:40,996 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 21:59:40,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293378930] [2019-12-27 21:59:40,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:40,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:59:40,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613311111] [2019-12-27 21:59:40,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:41,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:41,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 21:59:41,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:41,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:59:41,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:59:41,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:59:41,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:59:41,009 INFO L87 Difference]: Start difference. First operand 11475 states and 34983 transitions. Second operand 4 states. [2019-12-27 21:59:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:41,046 INFO L93 Difference]: Finished difference Result 1920 states and 4675 transitions. [2019-12-27 21:59:41,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:59:41,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 21:59:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:41,051 INFO L225 Difference]: With dead ends: 1920 [2019-12-27 21:59:41,051 INFO L226 Difference]: Without dead ends: 1382 [2019-12-27 21:59:41,052 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 21:59:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2019-12-27 21:59:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2019-12-27 21:59:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-12-27 21:59:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 3017 transitions. [2019-12-27 21:59:41,076 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 3017 transitions. Word has length 17 [2019-12-27 21:59:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:41,077 INFO L462 AbstractCegarLoop]: Abstraction has 1378 states and 3017 transitions. [2019-12-27 21:59:41,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:59:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 3017 transitions. [2019-12-27 21:59:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:59:41,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:41,079 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 21:59:41,079 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2091906228, now seen corresponding path program 1 times [2019-12-27 21:59:41,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:41,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745394337] [2019-12-27 21:59:41,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:41,211 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 21:59:41,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745394337] [2019-12-27 21:59:41,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:41,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:41,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [137371954] [2019-12-27 21:59:41,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:41,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:41,227 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:59:41,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:41,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:41,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:41,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:41,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:41,229 INFO L87 Difference]: Start difference. First operand 1378 states and 3017 transitions. Second operand 6 states. [2019-12-27 21:59:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:41,758 INFO L93 Difference]: Finished difference Result 3860 states and 8328 transitions. [2019-12-27 21:59:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:59:41,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 21:59:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:41,766 INFO L225 Difference]: With dead ends: 3860 [2019-12-27 21:59:41,766 INFO L226 Difference]: Without dead ends: 3825 [2019-12-27 21:59:41,767 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 21:59:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3825 states. [2019-12-27 21:59:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3825 to 2035. [2019-12-27 21:59:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 21:59:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4502 transitions. [2019-12-27 21:59:41,812 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4502 transitions. Word has length 25 [2019-12-27 21:59:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:41,813 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4502 transitions. [2019-12-27 21:59:41,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4502 transitions. [2019-12-27 21:59:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:59:41,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:41,816 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] [2019-12-27 21:59:41,816 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:41,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1541096581, now seen corresponding path program 1 times [2019-12-27 21:59:41,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:41,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204985847] [2019-12-27 21:59:41,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:41,909 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 21:59:41,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204985847] [2019-12-27 21:59:41,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:41,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:41,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327265353] [2019-12-27 21:59:41,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:41,916 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:41,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 21:59:41,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:41,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:41,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:41,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:41,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:41,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:41,924 INFO L87 Difference]: Start difference. First operand 2035 states and 4502 transitions. Second operand 6 states. [2019-12-27 21:59:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:42,361 INFO L93 Difference]: Finished difference Result 3781 states and 8072 transitions. [2019-12-27 21:59:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:59:42,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 21:59:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:42,368 INFO L225 Difference]: With dead ends: 3781 [2019-12-27 21:59:42,369 INFO L226 Difference]: Without dead ends: 3752 [2019-12-27 21:59:42,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:59:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2019-12-27 21:59:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 2007. [2019-12-27 21:59:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-12-27 21:59:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 4455 transitions. [2019-12-27 21:59:42,423 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 4455 transitions. Word has length 26 [2019-12-27 21:59:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:42,424 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 4455 transitions. [2019-12-27 21:59:42,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 4455 transitions. [2019-12-27 21:59:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:59:42,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:42,427 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] [2019-12-27 21:59:42,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1268776575, now seen corresponding path program 1 times [2019-12-27 21:59:42,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:42,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010864521] [2019-12-27 21:59:42,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:42,493 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 21:59:42,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010864521] [2019-12-27 21:59:42,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:42,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:59:42,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643908447] [2019-12-27 21:59:42,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:42,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:42,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 21:59:42,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:42,598 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:59:42,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:59:42,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:42,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:59:42,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:59:42,600 INFO L87 Difference]: Start difference. First operand 2007 states and 4455 transitions. Second operand 6 states. [2019-12-27 21:59:42,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:42,649 INFO L93 Difference]: Finished difference Result 1067 states and 2242 transitions. [2019-12-27 21:59:42,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:59:42,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:59:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:42,651 INFO L225 Difference]: With dead ends: 1067 [2019-12-27 21:59:42,651 INFO L226 Difference]: Without dead ends: 862 [2019-12-27 21:59:42,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:59:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-12-27 21:59:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 828. [2019-12-27 21:59:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-27 21:59:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1806 transitions. [2019-12-27 21:59:42,675 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1806 transitions. Word has length 27 [2019-12-27 21:59:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:42,676 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1806 transitions. [2019-12-27 21:59:42,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:59:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1806 transitions. [2019-12-27 21:59:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:59:42,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:42,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:42,682 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:42,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:42,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1725794524, now seen corresponding path program 1 times [2019-12-27 21:59:42,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:42,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371634842] [2019-12-27 21:59:42,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:42,815 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 21:59:42,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371634842] [2019-12-27 21:59:42,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:42,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:59:42,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [752883295] [2019-12-27 21:59:42,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:42,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:42,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 152 transitions. [2019-12-27 21:59:42,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:42,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:59:42,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:59:42,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:42,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:59:42,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:59:42,961 INFO L87 Difference]: Start difference. First operand 828 states and 1806 transitions. Second operand 8 states. [2019-12-27 21:59:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:43,175 INFO L93 Difference]: Finished difference Result 1705 states and 3607 transitions. [2019-12-27 21:59:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:59:43,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 21:59:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:43,177 INFO L225 Difference]: With dead ends: 1705 [2019-12-27 21:59:43,177 INFO L226 Difference]: Without dead ends: 1136 [2019-12-27 21:59:43,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:59:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-12-27 21:59:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 903. [2019-12-27 21:59:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-27 21:59:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1931 transitions. [2019-12-27 21:59:43,193 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1931 transitions. Word has length 51 [2019-12-27 21:59:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:43,193 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1931 transitions. [2019-12-27 21:59:43,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:59:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1931 transitions. [2019-12-27 21:59:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:59:43,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:43,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:43,196 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1701166622, now seen corresponding path program 2 times [2019-12-27 21:59:43,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:43,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572436323] [2019-12-27 21:59:43,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:43,272 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 21:59:43,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572436323] [2019-12-27 21:59:43,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:43,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:43,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626346790] [2019-12-27 21:59:43,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:43,292 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:43,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 157 transitions. [2019-12-27 21:59:43,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:43,365 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:59:43,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:43,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:43,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:43,366 INFO L87 Difference]: Start difference. First operand 903 states and 1931 transitions. Second operand 3 states. [2019-12-27 21:59:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:43,460 INFO L93 Difference]: Finished difference Result 1183 states and 2500 transitions. [2019-12-27 21:59:43,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:43,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:59:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:43,461 INFO L225 Difference]: With dead ends: 1183 [2019-12-27 21:59:43,461 INFO L226 Difference]: Without dead ends: 1183 [2019-12-27 21:59:43,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 21:59:43,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-12-27 21:59:43,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 993. [2019-12-27 21:59:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-27 21:59:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2127 transitions. [2019-12-27 21:59:43,479 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2127 transitions. Word has length 51 [2019-12-27 21:59:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:43,482 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 2127 transitions. [2019-12-27 21:59:43,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2127 transitions. [2019-12-27 21:59:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:59:43,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:43,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:43,491 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:43,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:43,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1213233403, now seen corresponding path program 1 times [2019-12-27 21:59:43,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:43,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349482796] [2019-12-27 21:59:43,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:43,555 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 21:59:43,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349482796] [2019-12-27 21:59:43,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:43,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:59:43,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904514410] [2019-12-27 21:59:43,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:43,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:43,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 160 transitions. [2019-12-27 21:59:43,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:43,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:43,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:43,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:43,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:43,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:43,647 INFO L87 Difference]: Start difference. First operand 993 states and 2127 transitions. Second operand 3 states. [2019-12-27 21:59:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:43,683 INFO L93 Difference]: Finished difference Result 1082 states and 2252 transitions. [2019-12-27 21:59:43,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:43,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:59:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:43,685 INFO L225 Difference]: With dead ends: 1082 [2019-12-27 21:59:43,685 INFO L226 Difference]: Without dead ends: 1082 [2019-12-27 21:59:43,686 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 21:59:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-12-27 21:59:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 930. [2019-12-27 21:59:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-12-27 21:59:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1974 transitions. [2019-12-27 21:59:43,701 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1974 transitions. Word has length 52 [2019-12-27 21:59:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:43,702 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1974 transitions. [2019-12-27 21:59:43,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1974 transitions. [2019-12-27 21:59:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:59:43,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:43,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:43,705 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash 105545405, now seen corresponding path program 1 times [2019-12-27 21:59:43,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:43,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990121928] [2019-12-27 21:59:43,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:59:43,808 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 21:59:43,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990121928] [2019-12-27 21:59:43,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:59:43,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:59:43,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [865946353] [2019-12-27 21:59:43,810 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:59:43,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:59:43,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 164 transitions. [2019-12-27 21:59:43,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:59:43,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:59:43,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:59:43,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:59:43,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:59:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:59:43,900 INFO L87 Difference]: Start difference. First operand 930 states and 1974 transitions. Second operand 3 states. [2019-12-27 21:59:43,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:59:43,915 INFO L93 Difference]: Finished difference Result 929 states and 1972 transitions. [2019-12-27 21:59:43,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:59:43,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:59:43,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:59:43,917 INFO L225 Difference]: With dead ends: 929 [2019-12-27 21:59:43,917 INFO L226 Difference]: Without dead ends: 929 [2019-12-27 21:59:43,917 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 21:59:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-27 21:59:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 670. [2019-12-27 21:59:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 21:59:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1434 transitions. [2019-12-27 21:59:43,930 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1434 transitions. Word has length 52 [2019-12-27 21:59:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:59:43,931 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1434 transitions. [2019-12-27 21:59:43,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:59:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1434 transitions. [2019-12-27 21:59:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:59:43,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:59:43,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:59:43,933 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:59:43,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:59:43,933 INFO L82 PathProgramCache]: Analyzing trace with hash -616115185, now seen corresponding path program 1 times [2019-12-27 21:59:43,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:59:43,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69122330] [2019-12-27 21:59:43,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:59:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:59:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:59:44,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:59:44,102 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:59:44,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_45| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_22|) 0) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= 0 v_~x$r_buff0_thd1~0_28) (= 0 v_~x$r_buff0_thd0~0_22) (= 0 v_~x$r_buff0_thd2~0_76) (= v_~x~0_24 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_22|) |v_ULTIMATE.start_main_~#t1713~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x$flush_delayed~0_13 0) (= v_~x$w_buff1_used~0_67 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= 0 v_~x$w_buff0~0_25) (= v_~y~0_15 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x$r_buff1_thd2~0_51 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_10 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1713~0.base_22| 4)) (= 0 v_~x$w_buff0_used~0_102) (= 0 |v_ULTIMATE.start_main_~#t1713~0.offset_17|) (= 0 v_~x$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1713~0.base_22|) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~x$r_buff1_thd0~0_19 0) (= |v_#valid_43| (store .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_22| 1)) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_25, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_15, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ULTIMATE.start_main_~#t1713~0.base=|v_ULTIMATE.start_main_~#t1713~0.base_22|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1713~0.offset=|v_ULTIMATE.start_main_~#t1713~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_24, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1714~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1714~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1713~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1713~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:59:44,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= v_~x$r_buff1_thd2~0_33 v_~x$r_buff0_thd2~0_56) (= v_~x$r_buff1_thd1~0_11 v_~x$r_buff0_thd1~0_17) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_14) (= 1 v_~y~0_5) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= 1 v_~x$r_buff0_thd1~0_16)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_33, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_11, ~y~0=v_~y~0_5, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_56, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:59:44,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1714~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12|) |v_ULTIMATE.start_main_~#t1714~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1714~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1714~0.base_12| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1714~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1714~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 21:59:44,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1501921085 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1501921085 256)))) (or (and (= ~x$w_buff0_used~0_In-1501921085 |P0Thread1of1ForFork0_#t~ite5_Out-1501921085|) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1501921085| 0) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1501921085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501921085} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1501921085|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1501921085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1501921085} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:59:44,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-458777316 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-458777316| |P1Thread1of1ForFork1_#t~ite14_Out-458777316|) .cse0 (= ~x$w_buff0~0_In-458777316 |P1Thread1of1ForFork1_#t~ite14_Out-458777316|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-458777316 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-458777316 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-458777316 256))) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-458777316 256) 0))))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-458777316| |P1Thread1of1ForFork1_#t~ite14_Out-458777316|) (= |P1Thread1of1ForFork1_#t~ite15_Out-458777316| ~x$w_buff0~0_In-458777316)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-458777316, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-458777316, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458777316, ~weak$$choice2~0=~weak$$choice2~0_In-458777316, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458777316, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-458777316|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458777316} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-458777316, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-458777316, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458777316, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-458777316|, ~weak$$choice2~0=~weak$$choice2~0_In-458777316, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458777316, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-458777316|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458777316} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:59:44,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In37930618 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out37930618| ~x$w_buff1~0_In37930618) (= |P1Thread1of1ForFork1_#t~ite17_In37930618| |P1Thread1of1ForFork1_#t~ite17_Out37930618|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out37930618| |P1Thread1of1ForFork1_#t~ite17_Out37930618|) (= |P1Thread1of1ForFork1_#t~ite17_Out37930618| ~x$w_buff1~0_In37930618) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In37930618 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In37930618 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In37930618 256)) (and (= (mod ~x$r_buff1_thd2~0_In37930618 256) 0) .cse1)))))) InVars {~x$w_buff1~0=~x$w_buff1~0_In37930618, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37930618, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In37930618, ~weak$$choice2~0=~weak$$choice2~0_In37930618, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In37930618, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In37930618|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In37930618} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out37930618|, ~x$w_buff1~0=~x$w_buff1~0_In37930618, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37930618, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In37930618, ~weak$$choice2~0=~weak$$choice2~0_In37930618, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In37930618, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out37930618|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In37930618} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 21:59:44,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In792824130 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out792824130| |P1Thread1of1ForFork1_#t~ite20_Out792824130|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In792824130 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In792824130 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In792824130 256)) (and (= 0 (mod ~x$r_buff1_thd2~0_In792824130 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out792824130| ~x$w_buff0_used~0_In792824130)) (and (= |P1Thread1of1ForFork1_#t~ite20_In792824130| |P1Thread1of1ForFork1_#t~ite20_Out792824130|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out792824130| ~x$w_buff0_used~0_In792824130)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In792824130|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In792824130, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In792824130, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In792824130, ~weak$$choice2~0=~weak$$choice2~0_In792824130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In792824130} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out792824130|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In792824130, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In792824130, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out792824130|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In792824130, ~weak$$choice2~0=~weak$$choice2~0_In792824130, ~x$w_buff0_used~0=~x$w_buff0_used~0_In792824130} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:59:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1657675646 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1657675646 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1657675646 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1657675646 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1657675646| ~x$w_buff1_used~0_In-1657675646) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1657675646| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1657675646, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1657675646, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1657675646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1657675646} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1657675646|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1657675646, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1657675646, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1657675646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1657675646} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:59:44,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2136305214 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In2136305214 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out2136305214) (not .cse1)) (and (= ~x$r_buff0_thd1~0_Out2136305214 ~x$r_buff0_thd1~0_In2136305214) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2136305214, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136305214} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out2136305214, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2136305214|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2136305214} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:59:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In1127638819 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1127638819 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In1127638819 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1127638819 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1127638819| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1127638819| ~x$r_buff1_thd1~0_In1127638819)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1127638819, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1127638819, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1127638819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1127638819} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1127638819, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1127638819|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1127638819, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1127638819, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1127638819} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:59:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L742-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:59:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd2~0_60 v_~x$r_buff0_thd2~0_59)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:59:44,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1473172825 256) 0))) (or (and (= ~x$r_buff1_thd2~0_In1473172825 |P1Thread1of1ForFork1_#t~ite30_Out1473172825|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In1473172825| |P1Thread1of1ForFork1_#t~ite29_Out1473172825|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1473172825| ~x$r_buff1_thd2~0_In1473172825) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1473172825 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1473172825 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1473172825 256))) (= (mod ~x$w_buff0_used~0_In1473172825 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out1473172825| |P1Thread1of1ForFork1_#t~ite30_Out1473172825|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1473172825|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1473172825, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1473172825, ~weak$$choice2~0=~weak$$choice2~0_In1473172825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1473172825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1473172825} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1473172825|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1473172825|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1473172825, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1473172825, ~weak$$choice2~0=~weak$$choice2~0_In1473172825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1473172825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1473172825} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 21:59:44,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 21:59:44,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-360139884 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-360139884 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-360139884| ~x$w_buff1~0_In-360139884) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-360139884| ~x~0_In-360139884) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-360139884, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-360139884, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-360139884, ~x~0=~x~0_In-360139884} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-360139884, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-360139884, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-360139884, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-360139884|, ~x~0=~x~0_In-360139884} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:59:44,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 21:59:44,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In160348581 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In160348581 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out160348581|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In160348581 |P1Thread1of1ForFork1_#t~ite34_Out160348581|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In160348581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In160348581} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out160348581|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In160348581, ~x$w_buff0_used~0=~x$w_buff0_used~0_In160348581} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:59:44,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1511874369 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1511874369 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1511874369 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1511874369 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1511874369| 0)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1511874369 |P1Thread1of1ForFork1_#t~ite35_Out1511874369|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1511874369, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1511874369, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1511874369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1511874369} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1511874369, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1511874369, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1511874369|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1511874369, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1511874369} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:59:44,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-157580604 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-157580604 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-157580604| ~x$r_buff0_thd2~0_In-157580604) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-157580604| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-157580604, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-157580604} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-157580604, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-157580604|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-157580604} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:59:44,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In506992466 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In506992466 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In506992466 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In506992466 256)))) (or (and (= ~x$r_buff1_thd2~0_In506992466 |P1Thread1of1ForFork1_#t~ite37_Out506992466|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out506992466|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In506992466, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In506992466, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In506992466, ~x$w_buff0_used~0=~x$w_buff0_used~0_In506992466} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In506992466, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In506992466, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In506992466, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out506992466|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In506992466} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:59:44,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:59:44,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_83 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_17 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:59:44,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In2137018190 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In2137018190 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2137018190| ~x$w_buff1~0_In2137018190)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2137018190| ~x~0_In2137018190)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2137018190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2137018190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2137018190, ~x~0=~x~0_In2137018190} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2137018190|, ~x$w_buff1~0=~x$w_buff1~0_In2137018190, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2137018190, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2137018190, ~x~0=~x~0_In2137018190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:59:44,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 21:59:44,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1102894761 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1102894761 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1102894761|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1102894761 |ULTIMATE.start_main_#t~ite42_Out1102894761|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1102894761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1102894761} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1102894761, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1102894761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1102894761} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:59:44,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1886417782 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1886417782 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1886417782 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1886417782 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1886417782| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1886417782| ~x$w_buff1_used~0_In-1886417782) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1886417782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1886417782, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1886417782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1886417782} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1886417782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1886417782, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1886417782|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1886417782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1886417782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:59:44,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1023356232 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1023356232 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1023356232 |ULTIMATE.start_main_#t~ite44_Out1023356232|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1023356232|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1023356232, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1023356232} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1023356232, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1023356232|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1023356232} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:59:44,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In525447308 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In525447308 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In525447308 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In525447308 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out525447308|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In525447308 |ULTIMATE.start_main_#t~ite45_Out525447308|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In525447308, ~x$w_buff1_used~0=~x$w_buff1_used~0_In525447308, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In525447308, ~x$w_buff0_used~0=~x$w_buff0_used~0_In525447308} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In525447308, ~x$w_buff1_used~0=~x$w_buff1_used~0_In525447308, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In525447308, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out525447308|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In525447308} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:59:44,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite45_14|) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y~0_13 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_14|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_13, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:59:44,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:59:44 BasicIcfg [2019-12-27 21:59:44,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:59:44,218 INFO L168 Benchmark]: Toolchain (without parser) took 15299.03 ms. Allocated memory was 138.9 MB in the beginning and 797.4 MB in the end (delta: 658.5 MB). Free memory was 100.9 MB in the beginning and 317.5 MB in the end (delta: -216.6 MB). Peak memory consumption was 441.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:44,219 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:59:44,219 INFO L168 Benchmark]: CACSL2BoogieTranslator took 692.04 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 157.5 MB in the end (delta: -57.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:44,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.95 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:44,221 INFO L168 Benchmark]: Boogie Preprocessor took 36.30 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:44,221 INFO L168 Benchmark]: RCFGBuilder took 746.61 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 108.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:44,222 INFO L168 Benchmark]: TraceAbstraction took 13757.36 ms. Allocated memory was 203.4 MB in the beginning and 797.4 MB in the end (delta: 594.0 MB). Free memory was 108.1 MB in the beginning and 317.5 MB in the end (delta: -209.5 MB). Peak memory consumption was 384.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:59:44,226 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 692.04 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 157.5 MB in the end (delta: -57.0 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.95 ms. Allocated memory is still 203.4 MB. Free memory was 157.5 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.30 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 746.61 ms. Allocated memory is still 203.4 MB. Free memory was 152.9 MB in the beginning and 108.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13757.36 ms. Allocated memory was 203.4 MB in the beginning and 797.4 MB in the end (delta: 594.0 MB). Free memory was 108.1 MB in the beginning and 317.5 MB in the end (delta: -209.5 MB). Peak memory consumption was 384.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 147 ProgramPointsBefore, 80 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4527 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50908 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1557 SDtfs, 1650 SDslu, 2326 SDs, 0 SdLazy, 1142 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12676occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 7965 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 31947 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...