/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:44:58,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:44:58,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:44:58,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:44:58,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:44:58,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:44:58,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:44:58,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:44:58,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:44:58,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:44:58,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:44:58,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:44:58,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:44:58,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:44:58,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:44:58,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:44:58,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:44:58,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:44:58,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:44:58,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:44:58,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:44:58,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:44:58,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:44:58,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:44:58,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:44:58,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:44:58,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:44:58,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:44:58,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:44:58,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:44:58,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:44:58,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:44:58,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:44:58,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:44:58,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:44:58,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:44:58,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:44:58,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:44:58,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:44:58,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:44:58,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:44:58,730 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:44:58,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:44:58,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:44:58,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:44:58,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:44:58,746 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:44:58,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:44:58,746 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:44:58,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:44:58,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:44:58,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:44:58,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:44:58,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:44:58,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:44:58,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:44:58,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:44:58,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:44:58,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:44:58,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:44:58,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:44:58,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:44:58,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:44:58,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:44:58,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:44:58,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:44:58,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:44:58,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:44:58,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:44:58,752 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:44:58,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:44:58,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:44:59,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:44:59,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:44:59,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:44:59,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:44:59,045 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:44:59,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-18 20:44:59,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37e1d9e3/b5a3f8ea0d6e49a7890e714066971526/FLAGbb0ad90eb [2019-12-18 20:44:59,659 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:44:59,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-18 20:44:59,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37e1d9e3/b5a3f8ea0d6e49a7890e714066971526/FLAGbb0ad90eb [2019-12-18 20:44:59,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c37e1d9e3/b5a3f8ea0d6e49a7890e714066971526 [2019-12-18 20:44:59,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:44:59,945 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:44:59,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:44:59,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:44:59,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:44:59,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:44:59" (1/1) ... [2019-12-18 20:44:59,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f27377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:44:59, skipping insertion in model container [2019-12-18 20:44:59,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:44:59" (1/1) ... [2019-12-18 20:44:59,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:45:00,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:45:00,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:45:00,662 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:45:00,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:45:00,821 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:45:00,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00 WrapperNode [2019-12-18 20:45:00,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:45:00,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:45:00,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:45:00,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:45:00,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,854 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:45:00,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:45:00,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:45:00,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:45:00,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (1/1) ... [2019-12-18 20:45:00,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:45:00,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:45:00,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:45:00,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:45:00,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (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-18 20:45:01,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:45:01,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:45:01,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:45:01,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:45:01,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:45:01,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:45:01,017 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:45:01,017 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:45:01,017 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:45:01,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:45:01,018 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:45:01,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:45:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:45:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:45:01,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:45:01,021 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:45:01,773 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:45:01,773 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:45:01,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:45:01 BoogieIcfgContainer [2019-12-18 20:45:01,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:45:01,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:45:01,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:45:01,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:45:01,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:44:59" (1/3) ... [2019-12-18 20:45:01,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e4845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:45:01, skipping insertion in model container [2019-12-18 20:45:01,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:45:00" (2/3) ... [2019-12-18 20:45:01,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9e4845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:45:01, skipping insertion in model container [2019-12-18 20:45:01,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:45:01" (3/3) ... [2019-12-18 20:45:01,784 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_rmo.opt.i [2019-12-18 20:45:01,795 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:45:01,795 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:45:01,808 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:45:01,809 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:45:01,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,861 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,909 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,909 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,917 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,917 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,917 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,926 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,926 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,930 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,931 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,936 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,937 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,937 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,938 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,938 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,950 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,954 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:45:01,971 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:45:01,993 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:45:01,993 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:45:01,994 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:45:01,994 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:45:01,994 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:45:01,994 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:45:01,994 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:45:01,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:45:02,009 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 20:45:02,012 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:45:02,103 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:45:02,104 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:45:02,123 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:45:02,151 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 20:45:02,199 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 20:45:02,199 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:45:02,208 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 20:45:02,230 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 20:45:02,231 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:45:05,519 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-18 20:45:06,413 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 20:45:06,551 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 20:45:06,569 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68763 [2019-12-18 20:45:06,570 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 20:45:06,573 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 94 transitions [2019-12-18 20:45:40,068 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 166438 states. [2019-12-18 20:45:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 166438 states. [2019-12-18 20:45:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:45:40,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:45:40,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:45:40,078 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:45:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:45:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash 404581936, now seen corresponding path program 1 times [2019-12-18 20:45:40,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:45:40,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637264437] [2019-12-18 20:45:40,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:45:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:45:40,342 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-18 20:45:40,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637264437] [2019-12-18 20:45:40,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:45:40,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:45:40,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116841908] [2019-12-18 20:45:40,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:45:40,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:45:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:45:40,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:45:40,365 INFO L87 Difference]: Start difference. First operand 166438 states. Second operand 3 states. [2019-12-18 20:45:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:45:44,596 INFO L93 Difference]: Finished difference Result 163218 states and 783804 transitions. [2019-12-18 20:45:44,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:45:44,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:45:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:45:48,690 INFO L225 Difference]: With dead ends: 163218 [2019-12-18 20:45:48,691 INFO L226 Difference]: Without dead ends: 153026 [2019-12-18 20:45:48,692 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-18 20:45:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153026 states. [2019-12-18 20:45:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153026 to 153026. [2019-12-18 20:45:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153026 states. [2019-12-18 20:46:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153026 states to 153026 states and 733880 transitions. [2019-12-18 20:46:04,849 INFO L78 Accepts]: Start accepts. Automaton has 153026 states and 733880 transitions. Word has length 7 [2019-12-18 20:46:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:04,850 INFO L462 AbstractCegarLoop]: Abstraction has 153026 states and 733880 transitions. [2019-12-18 20:46:04,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 153026 states and 733880 transitions. [2019-12-18 20:46:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:46:04,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:04,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:04,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:04,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1448601888, now seen corresponding path program 1 times [2019-12-18 20:46:04,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:04,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806103704] [2019-12-18 20:46:04,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:04,966 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-18 20:46:04,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806103704] [2019-12-18 20:46:04,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:04,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:04,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464451107] [2019-12-18 20:46:04,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:04,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:04,973 INFO L87 Difference]: Start difference. First operand 153026 states and 733880 transitions. Second operand 3 states. [2019-12-18 20:46:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:05,781 INFO L93 Difference]: Finished difference Result 96841 states and 419275 transitions. [2019-12-18 20:46:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:05,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 20:46:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:06,157 INFO L225 Difference]: With dead ends: 96841 [2019-12-18 20:46:06,157 INFO L226 Difference]: Without dead ends: 96841 [2019-12-18 20:46:06,158 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-18 20:46:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96841 states. [2019-12-18 20:46:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96841 to 96841. [2019-12-18 20:46:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96841 states. [2019-12-18 20:46:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96841 states to 96841 states and 419275 transitions. [2019-12-18 20:46:18,993 INFO L78 Accepts]: Start accepts. Automaton has 96841 states and 419275 transitions. Word has length 15 [2019-12-18 20:46:18,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:18,993 INFO L462 AbstractCegarLoop]: Abstraction has 96841 states and 419275 transitions. [2019-12-18 20:46:18,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:18,993 INFO L276 IsEmpty]: Start isEmpty. Operand 96841 states and 419275 transitions. [2019-12-18 20:46:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:46:18,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:18,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:18,997 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:18,997 INFO L82 PathProgramCache]: Analyzing trace with hash 576667599, now seen corresponding path program 1 times [2019-12-18 20:46:18,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:18,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371337289] [2019-12-18 20:46:18,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:19,095 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-18 20:46:19,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371337289] [2019-12-18 20:46:19,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:19,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:19,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040861275] [2019-12-18 20:46:19,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:19,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:19,098 INFO L87 Difference]: Start difference. First operand 96841 states and 419275 transitions. Second operand 4 states. [2019-12-18 20:46:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:20,112 INFO L93 Difference]: Finished difference Result 146922 states and 610245 transitions. [2019-12-18 20:46:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:46:20,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:46:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:21,238 INFO L225 Difference]: With dead ends: 146922 [2019-12-18 20:46:21,239 INFO L226 Difference]: Without dead ends: 146817 [2019-12-18 20:46:21,239 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-18 20:46:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146817 states. [2019-12-18 20:46:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146817 to 132421. [2019-12-18 20:46:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132421 states. [2019-12-18 20:46:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132421 states to 132421 states and 557528 transitions. [2019-12-18 20:46:29,029 INFO L78 Accepts]: Start accepts. Automaton has 132421 states and 557528 transitions. Word has length 15 [2019-12-18 20:46:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:29,030 INFO L462 AbstractCegarLoop]: Abstraction has 132421 states and 557528 transitions. [2019-12-18 20:46:29,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 132421 states and 557528 transitions. [2019-12-18 20:46:29,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:46:29,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:29,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:29,036 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:29,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:29,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1043569302, now seen corresponding path program 1 times [2019-12-18 20:46:29,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:29,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122506681] [2019-12-18 20:46:29,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:29,104 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-18 20:46:29,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122506681] [2019-12-18 20:46:29,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:29,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:29,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210839041] [2019-12-18 20:46:29,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:29,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:29,107 INFO L87 Difference]: Start difference. First operand 132421 states and 557528 transitions. Second operand 4 states. [2019-12-18 20:46:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:29,305 INFO L93 Difference]: Finished difference Result 36987 states and 132370 transitions. [2019-12-18 20:46:29,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:46:29,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:46:29,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:29,376 INFO L225 Difference]: With dead ends: 36987 [2019-12-18 20:46:29,376 INFO L226 Difference]: Without dead ends: 36987 [2019-12-18 20:46:29,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36987 states. [2019-12-18 20:46:29,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36987 to 36987. [2019-12-18 20:46:29,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36987 states. [2019-12-18 20:46:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36987 states to 36987 states and 132370 transitions. [2019-12-18 20:46:30,045 INFO L78 Accepts]: Start accepts. Automaton has 36987 states and 132370 transitions. Word has length 16 [2019-12-18 20:46:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:30,045 INFO L462 AbstractCegarLoop]: Abstraction has 36987 states and 132370 transitions. [2019-12-18 20:46:30,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 36987 states and 132370 transitions. [2019-12-18 20:46:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:46:30,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:30,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:30,048 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash 372623930, now seen corresponding path program 1 times [2019-12-18 20:46:30,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:30,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552179727] [2019-12-18 20:46:30,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:30,143 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-18 20:46:30,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552179727] [2019-12-18 20:46:30,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:30,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:30,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339807614] [2019-12-18 20:46:30,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:30,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:30,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:30,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:30,146 INFO L87 Difference]: Start difference. First operand 36987 states and 132370 transitions. Second operand 5 states. [2019-12-18 20:46:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:31,086 INFO L93 Difference]: Finished difference Result 54351 states and 190541 transitions. [2019-12-18 20:46:31,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:46:31,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 20:46:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:31,197 INFO L225 Difference]: With dead ends: 54351 [2019-12-18 20:46:31,197 INFO L226 Difference]: Without dead ends: 54333 [2019-12-18 20:46:31,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:46:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54333 states. [2019-12-18 20:46:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54333 to 42478. [2019-12-18 20:46:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42478 states. [2019-12-18 20:46:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42478 states to 42478 states and 151468 transitions. [2019-12-18 20:46:32,038 INFO L78 Accepts]: Start accepts. Automaton has 42478 states and 151468 transitions. Word has length 16 [2019-12-18 20:46:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:32,038 INFO L462 AbstractCegarLoop]: Abstraction has 42478 states and 151468 transitions. [2019-12-18 20:46:32,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 42478 states and 151468 transitions. [2019-12-18 20:46:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:46:32,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:32,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:32,055 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash -351800871, now seen corresponding path program 1 times [2019-12-18 20:46:32,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:32,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228968404] [2019-12-18 20:46:32,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:32,163 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-18 20:46:32,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228968404] [2019-12-18 20:46:32,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:32,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:46:32,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581594034] [2019-12-18 20:46:32,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:46:32,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:46:32,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:46:32,166 INFO L87 Difference]: Start difference. First operand 42478 states and 151468 transitions. Second operand 6 states. [2019-12-18 20:46:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:33,500 INFO L93 Difference]: Finished difference Result 63900 states and 221523 transitions. [2019-12-18 20:46:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:46:33,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 20:46:33,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:33,633 INFO L225 Difference]: With dead ends: 63900 [2019-12-18 20:46:33,633 INFO L226 Difference]: Without dead ends: 63870 [2019-12-18 20:46:33,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:46:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-18 20:46:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 42427. [2019-12-18 20:46:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42427 states. [2019-12-18 20:46:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42427 states to 42427 states and 150408 transitions. [2019-12-18 20:46:34,571 INFO L78 Accepts]: Start accepts. Automaton has 42427 states and 150408 transitions. Word has length 24 [2019-12-18 20:46:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:34,572 INFO L462 AbstractCegarLoop]: Abstraction has 42427 states and 150408 transitions. [2019-12-18 20:46:34,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:46:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42427 states and 150408 transitions. [2019-12-18 20:46:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:46:34,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:34,601 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] [2019-12-18 20:46:34,601 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash -478348385, now seen corresponding path program 1 times [2019-12-18 20:46:34,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:34,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708183162] [2019-12-18 20:46:34,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:34,666 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-18 20:46:34,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708183162] [2019-12-18 20:46:34,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:34,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:46:34,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838135292] [2019-12-18 20:46:34,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:34,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:34,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:34,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:34,668 INFO L87 Difference]: Start difference. First operand 42427 states and 150408 transitions. Second operand 5 states. [2019-12-18 20:46:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:35,094 INFO L93 Difference]: Finished difference Result 22700 states and 81312 transitions. [2019-12-18 20:46:35,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:46:35,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:46:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:35,136 INFO L225 Difference]: With dead ends: 22700 [2019-12-18 20:46:35,137 INFO L226 Difference]: Without dead ends: 22700 [2019-12-18 20:46:35,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22700 states. [2019-12-18 20:46:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22700 to 22364. [2019-12-18 20:46:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22364 states. [2019-12-18 20:46:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22364 states to 22364 states and 80168 transitions. [2019-12-18 20:46:35,493 INFO L78 Accepts]: Start accepts. Automaton has 22364 states and 80168 transitions. Word has length 28 [2019-12-18 20:46:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:35,494 INFO L462 AbstractCegarLoop]: Abstraction has 22364 states and 80168 transitions. [2019-12-18 20:46:35,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 22364 states and 80168 transitions. [2019-12-18 20:46:35,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 20:46:35,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:35,531 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] [2019-12-18 20:46:35,531 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:35,532 INFO L82 PathProgramCache]: Analyzing trace with hash -89817491, now seen corresponding path program 1 times [2019-12-18 20:46:35,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:35,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372884973] [2019-12-18 20:46:35,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:46:35,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372884973] [2019-12-18 20:46:35,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:35,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:35,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786142861] [2019-12-18 20:46:35,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:35,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:35,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:35,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:35,608 INFO L87 Difference]: Start difference. First operand 22364 states and 80168 transitions. Second operand 3 states. [2019-12-18 20:46:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:35,796 INFO L93 Difference]: Finished difference Result 33735 states and 115366 transitions. [2019-12-18 20:46:35,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:35,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 20:46:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:35,860 INFO L225 Difference]: With dead ends: 33735 [2019-12-18 20:46:35,861 INFO L226 Difference]: Without dead ends: 22811 [2019-12-18 20:46:35,861 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-18 20:46:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22811 states. [2019-12-18 20:46:36,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22811 to 22329. [2019-12-18 20:46:36,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22329 states. [2019-12-18 20:46:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22329 states to 22329 states and 69880 transitions. [2019-12-18 20:46:36,307 INFO L78 Accepts]: Start accepts. Automaton has 22329 states and 69880 transitions. Word has length 42 [2019-12-18 20:46:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:36,307 INFO L462 AbstractCegarLoop]: Abstraction has 22329 states and 69880 transitions. [2019-12-18 20:46:36,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:36,308 INFO L276 IsEmpty]: Start isEmpty. Operand 22329 states and 69880 transitions. [2019-12-18 20:46:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 20:46:36,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:36,338 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] [2019-12-18 20:46:36,338 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1643728433, now seen corresponding path program 1 times [2019-12-18 20:46:36,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:36,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175216566] [2019-12-18 20:46:36,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:36,439 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-18 20:46:36,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175216566] [2019-12-18 20:46:36,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:36,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:46:36,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191081408] [2019-12-18 20:46:36,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:46:36,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:36,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:46:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:46:36,443 INFO L87 Difference]: Start difference. First operand 22329 states and 69880 transitions. Second operand 6 states. [2019-12-18 20:46:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:36,553 INFO L93 Difference]: Finished difference Result 21070 states and 66665 transitions. [2019-12-18 20:46:36,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:46:36,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 20:46:36,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:36,571 INFO L225 Difference]: With dead ends: 21070 [2019-12-18 20:46:36,571 INFO L226 Difference]: Without dead ends: 10890 [2019-12-18 20:46:36,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:46:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-12-18 20:46:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10414. [2019-12-18 20:46:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-18 20:46:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 32808 transitions. [2019-12-18 20:46:36,913 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 32808 transitions. Word has length 43 [2019-12-18 20:46:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:36,913 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 32808 transitions. [2019-12-18 20:46:36,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:46:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 32808 transitions. [2019-12-18 20:46:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:36,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:36,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:36,931 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:36,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash -400777059, now seen corresponding path program 1 times [2019-12-18 20:46:36,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:36,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922973330] [2019-12-18 20:46:36,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:37,053 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-18 20:46:37,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922973330] [2019-12-18 20:46:37,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:37,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:37,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052857166] [2019-12-18 20:46:37,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:46:37,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:46:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:46:37,056 INFO L87 Difference]: Start difference. First operand 10414 states and 32808 transitions. Second operand 4 states. [2019-12-18 20:46:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:37,134 INFO L93 Difference]: Finished difference Result 18914 states and 59584 transitions. [2019-12-18 20:46:37,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:46:37,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 20:46:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:37,148 INFO L225 Difference]: With dead ends: 18914 [2019-12-18 20:46:37,148 INFO L226 Difference]: Without dead ends: 8811 [2019-12-18 20:46:37,149 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-18 20:46:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8811 states. [2019-12-18 20:46:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8811 to 8811. [2019-12-18 20:46:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-18 20:46:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 27635 transitions. [2019-12-18 20:46:37,277 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 27635 transitions. Word has length 57 [2019-12-18 20:46:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:37,277 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 27635 transitions. [2019-12-18 20:46:37,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:46:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 27635 transitions. [2019-12-18 20:46:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:37,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:37,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:37,287 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2006827895, now seen corresponding path program 2 times [2019-12-18 20:46:37,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:37,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353031060] [2019-12-18 20:46:37,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:37,382 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-18 20:46:37,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353031060] [2019-12-18 20:46:37,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:37,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:46:37,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311422463] [2019-12-18 20:46:37,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:46:37,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:46:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:46:37,385 INFO L87 Difference]: Start difference. First operand 8811 states and 27635 transitions. Second operand 7 states. [2019-12-18 20:46:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:37,748 INFO L93 Difference]: Finished difference Result 23195 states and 72754 transitions. [2019-12-18 20:46:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 20:46:37,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:46:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:37,776 INFO L225 Difference]: With dead ends: 23195 [2019-12-18 20:46:37,777 INFO L226 Difference]: Without dead ends: 17949 [2019-12-18 20:46:37,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 20:46:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17949 states. [2019-12-18 20:46:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17949 to 10607. [2019-12-18 20:46:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10607 states. [2019-12-18 20:46:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 33546 transitions. [2019-12-18 20:46:37,979 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 33546 transitions. Word has length 57 [2019-12-18 20:46:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:37,979 INFO L462 AbstractCegarLoop]: Abstraction has 10607 states and 33546 transitions. [2019-12-18 20:46:37,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:46:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 33546 transitions. [2019-12-18 20:46:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:37,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:37,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:37,990 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:37,991 INFO L82 PathProgramCache]: Analyzing trace with hash 716545355, now seen corresponding path program 3 times [2019-12-18 20:46:37,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:37,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823997106] [2019-12-18 20:46:37,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:38,109 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-18 20:46:38,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823997106] [2019-12-18 20:46:38,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:38,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:46:38,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070509472] [2019-12-18 20:46:38,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:46:38,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:38,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:46:38,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:46:38,112 INFO L87 Difference]: Start difference. First operand 10607 states and 33546 transitions. Second operand 8 states. [2019-12-18 20:46:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:39,130 INFO L93 Difference]: Finished difference Result 44112 states and 139302 transitions. [2019-12-18 20:46:39,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:46:39,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 20:46:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:39,180 INFO L225 Difference]: With dead ends: 44112 [2019-12-18 20:46:39,180 INFO L226 Difference]: Without dead ends: 31559 [2019-12-18 20:46:39,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 20:46:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31559 states. [2019-12-18 20:46:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31559 to 13319. [2019-12-18 20:46:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13319 states. [2019-12-18 20:46:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 42674 transitions. [2019-12-18 20:46:39,664 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 42674 transitions. Word has length 57 [2019-12-18 20:46:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:39,664 INFO L462 AbstractCegarLoop]: Abstraction has 13319 states and 42674 transitions. [2019-12-18 20:46:39,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:46:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 42674 transitions. [2019-12-18 20:46:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:39,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:39,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, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:39,682 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:39,683 INFO L82 PathProgramCache]: Analyzing trace with hash -747821109, now seen corresponding path program 1 times [2019-12-18 20:46:39,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:39,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163581130] [2019-12-18 20:46:39,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:39,730 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-18 20:46:39,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163581130] [2019-12-18 20:46:39,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:39,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:46:39,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255134400] [2019-12-18 20:46:39,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:39,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:39,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:39,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:39,732 INFO L87 Difference]: Start difference. First operand 13319 states and 42674 transitions. Second operand 3 states. [2019-12-18 20:46:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:39,876 INFO L93 Difference]: Finished difference Result 18060 states and 57175 transitions. [2019-12-18 20:46:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:39,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:46:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:39,914 INFO L225 Difference]: With dead ends: 18060 [2019-12-18 20:46:39,914 INFO L226 Difference]: Without dead ends: 18060 [2019-12-18 20:46:39,914 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-18 20:46:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18060 states. [2019-12-18 20:46:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18060 to 15832. [2019-12-18 20:46:40,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15832 states. [2019-12-18 20:46:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15832 states to 15832 states and 50778 transitions. [2019-12-18 20:46:40,233 INFO L78 Accepts]: Start accepts. Automaton has 15832 states and 50778 transitions. Word has length 57 [2019-12-18 20:46:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:40,233 INFO L462 AbstractCegarLoop]: Abstraction has 15832 states and 50778 transitions. [2019-12-18 20:46:40,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 15832 states and 50778 transitions. [2019-12-18 20:46:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:40,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:40,259 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:40,259 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:40,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash -780825525, now seen corresponding path program 4 times [2019-12-18 20:46:40,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:40,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242760514] [2019-12-18 20:46:40,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:40,376 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-18 20:46:40,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242760514] [2019-12-18 20:46:40,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:40,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:46:40,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186605191] [2019-12-18 20:46:40,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:46:40,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:40,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:46:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:46:40,378 INFO L87 Difference]: Start difference. First operand 15832 states and 50778 transitions. Second operand 9 states. [2019-12-18 20:46:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:41,680 INFO L93 Difference]: Finished difference Result 60662 states and 186954 transitions. [2019-12-18 20:46:41,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:46:41,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:46:41,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:41,769 INFO L225 Difference]: With dead ends: 60662 [2019-12-18 20:46:41,769 INFO L226 Difference]: Without dead ends: 56362 [2019-12-18 20:46:41,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2019-12-18 20:46:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56362 states. [2019-12-18 20:46:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56362 to 16687. [2019-12-18 20:46:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16687 states. [2019-12-18 20:46:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16687 states to 16687 states and 53640 transitions. [2019-12-18 20:46:42,494 INFO L78 Accepts]: Start accepts. Automaton has 16687 states and 53640 transitions. Word has length 57 [2019-12-18 20:46:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:42,494 INFO L462 AbstractCegarLoop]: Abstraction has 16687 states and 53640 transitions. [2019-12-18 20:46:42,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:46:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 16687 states and 53640 transitions. [2019-12-18 20:46:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:42,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:42,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:42,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1562304933, now seen corresponding path program 5 times [2019-12-18 20:46:42,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:42,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062461243] [2019-12-18 20:46:42,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:42,632 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-18 20:46:42,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062461243] [2019-12-18 20:46:42,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:42,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:46:42,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964993958] [2019-12-18 20:46:42,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:46:42,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:42,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:46:42,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:46:42,634 INFO L87 Difference]: Start difference. First operand 16687 states and 53640 transitions. Second operand 9 states. [2019-12-18 20:46:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:44,002 INFO L93 Difference]: Finished difference Result 48042 states and 147444 transitions. [2019-12-18 20:46:44,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 20:46:44,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 20:46:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:44,065 INFO L225 Difference]: With dead ends: 48042 [2019-12-18 20:46:44,065 INFO L226 Difference]: Without dead ends: 41776 [2019-12-18 20:46:44,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2019-12-18 20:46:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41776 states. [2019-12-18 20:46:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41776 to 15886. [2019-12-18 20:46:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-12-18 20:46:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 51044 transitions. [2019-12-18 20:46:44,510 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 51044 transitions. Word has length 57 [2019-12-18 20:46:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:44,510 INFO L462 AbstractCegarLoop]: Abstraction has 15886 states and 51044 transitions. [2019-12-18 20:46:44,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:46:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 51044 transitions. [2019-12-18 20:46:44,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:44,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:44,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:44,528 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:44,529 INFO L82 PathProgramCache]: Analyzing trace with hash -414013221, now seen corresponding path program 6 times [2019-12-18 20:46:44,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:44,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575055060] [2019-12-18 20:46:44,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:44,616 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-18 20:46:44,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575055060] [2019-12-18 20:46:44,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:44,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:46:44,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448068207] [2019-12-18 20:46:44,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:46:44,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:46:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:46:44,618 INFO L87 Difference]: Start difference. First operand 15886 states and 51044 transitions. Second operand 7 states. [2019-12-18 20:46:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:45,054 INFO L93 Difference]: Finished difference Result 32290 states and 101146 transitions. [2019-12-18 20:46:45,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:46:45,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 20:46:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:45,128 INFO L225 Difference]: With dead ends: 32290 [2019-12-18 20:46:45,128 INFO L226 Difference]: Without dead ends: 27252 [2019-12-18 20:46:45,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 20:46:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27252 states. [2019-12-18 20:46:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27252 to 16096. [2019-12-18 20:46:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16096 states. [2019-12-18 20:46:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16096 states to 16096 states and 51631 transitions. [2019-12-18 20:46:45,733 INFO L78 Accepts]: Start accepts. Automaton has 16096 states and 51631 transitions. Word has length 57 [2019-12-18 20:46:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:45,734 INFO L462 AbstractCegarLoop]: Abstraction has 16096 states and 51631 transitions. [2019-12-18 20:46:45,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:46:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16096 states and 51631 transitions. [2019-12-18 20:46:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:45,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:45,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:45,752 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1111165587, now seen corresponding path program 7 times [2019-12-18 20:46:45,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:45,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616613640] [2019-12-18 20:46:45,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:45,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-18 20:46:45,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616613640] [2019-12-18 20:46:45,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:45,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:46:45,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424024156] [2019-12-18 20:46:45,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:45,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:45,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:45,841 INFO L87 Difference]: Start difference. First operand 16096 states and 51631 transitions. Second operand 5 states. [2019-12-18 20:46:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:46,347 INFO L93 Difference]: Finished difference Result 24102 states and 75006 transitions. [2019-12-18 20:46:46,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:46:46,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 20:46:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:46,383 INFO L225 Difference]: With dead ends: 24102 [2019-12-18 20:46:46,383 INFO L226 Difference]: Without dead ends: 23976 [2019-12-18 20:46:46,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:46:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23976 states. [2019-12-18 20:46:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23976 to 19024. [2019-12-18 20:46:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19024 states. [2019-12-18 20:46:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19024 states to 19024 states and 60429 transitions. [2019-12-18 20:46:46,709 INFO L78 Accepts]: Start accepts. Automaton has 19024 states and 60429 transitions. Word has length 57 [2019-12-18 20:46:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:46,709 INFO L462 AbstractCegarLoop]: Abstraction has 19024 states and 60429 transitions. [2019-12-18 20:46:46,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 19024 states and 60429 transitions. [2019-12-18 20:46:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:46,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:46,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:46,732 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1189678611, now seen corresponding path program 8 times [2019-12-18 20:46:46,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:46,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600555278] [2019-12-18 20:46:46,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:46,809 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-18 20:46:46,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600555278] [2019-12-18 20:46:46,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:46,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:46:46,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408326547] [2019-12-18 20:46:46,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:46:46,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:46:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:46:46,815 INFO L87 Difference]: Start difference. First operand 19024 states and 60429 transitions. Second operand 5 states. [2019-12-18 20:46:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:47,283 INFO L93 Difference]: Finished difference Result 25682 states and 80014 transitions. [2019-12-18 20:46:47,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:46:47,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 20:46:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:47,323 INFO L225 Difference]: With dead ends: 25682 [2019-12-18 20:46:47,324 INFO L226 Difference]: Without dead ends: 25499 [2019-12-18 20:46:47,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:46:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25499 states. [2019-12-18 20:46:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25499 to 22650. [2019-12-18 20:46:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22650 states. [2019-12-18 20:46:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22650 states to 22650 states and 71520 transitions. [2019-12-18 20:46:47,823 INFO L78 Accepts]: Start accepts. Automaton has 22650 states and 71520 transitions. Word has length 57 [2019-12-18 20:46:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:47,823 INFO L462 AbstractCegarLoop]: Abstraction has 22650 states and 71520 transitions. [2019-12-18 20:46:47,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:46:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 22650 states and 71520 transitions. [2019-12-18 20:46:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 20:46:47,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:47,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:47,851 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1103228865, now seen corresponding path program 9 times [2019-12-18 20:46:47,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:47,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059077308] [2019-12-18 20:46:47,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:47,913 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-18 20:46:47,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059077308] [2019-12-18 20:46:47,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:47,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:47,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605019383] [2019-12-18 20:46:47,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:47,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:47,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:47,915 INFO L87 Difference]: Start difference. First operand 22650 states and 71520 transitions. Second operand 3 states. [2019-12-18 20:46:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:48,021 INFO L93 Difference]: Finished difference Result 22650 states and 71518 transitions. [2019-12-18 20:46:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:48,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 20:46:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:48,071 INFO L225 Difference]: With dead ends: 22650 [2019-12-18 20:46:48,071 INFO L226 Difference]: Without dead ends: 22650 [2019-12-18 20:46:48,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22650 states. [2019-12-18 20:46:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22650 to 20990. [2019-12-18 20:46:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20990 states. [2019-12-18 20:46:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20990 states to 20990 states and 66993 transitions. [2019-12-18 20:46:48,670 INFO L78 Accepts]: Start accepts. Automaton has 20990 states and 66993 transitions. Word has length 57 [2019-12-18 20:46:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:48,670 INFO L462 AbstractCegarLoop]: Abstraction has 20990 states and 66993 transitions. [2019-12-18 20:46:48,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 20990 states and 66993 transitions. [2019-12-18 20:46:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 20:46:48,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:48,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:48,708 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1000017382, now seen corresponding path program 1 times [2019-12-18 20:46:48,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:48,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057179316] [2019-12-18 20:46:48,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:46:48,806 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-18 20:46:48,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057179316] [2019-12-18 20:46:48,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:46:48,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:46:48,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175431054] [2019-12-18 20:46:48,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:46:48,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:46:48,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:46:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:46:48,808 INFO L87 Difference]: Start difference. First operand 20990 states and 66993 transitions. Second operand 3 states. [2019-12-18 20:46:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:46:48,885 INFO L93 Difference]: Finished difference Result 15219 states and 47567 transitions. [2019-12-18 20:46:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:46:48,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 20:46:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:46:48,908 INFO L225 Difference]: With dead ends: 15219 [2019-12-18 20:46:48,908 INFO L226 Difference]: Without dead ends: 15219 [2019-12-18 20:46:48,909 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-18 20:46:48,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15219 states. [2019-12-18 20:46:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15219 to 14624. [2019-12-18 20:46:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14624 states. [2019-12-18 20:46:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14624 states to 14624 states and 45626 transitions. [2019-12-18 20:46:49,118 INFO L78 Accepts]: Start accepts. Automaton has 14624 states and 45626 transitions. Word has length 58 [2019-12-18 20:46:49,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:46:49,118 INFO L462 AbstractCegarLoop]: Abstraction has 14624 states and 45626 transitions. [2019-12-18 20:46:49,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:46:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 14624 states and 45626 transitions. [2019-12-18 20:46:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 20:46:49,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:46:49,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:46:49,133 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:46:49,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:46:49,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1487548287, now seen corresponding path program 1 times [2019-12-18 20:46:49,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:46:49,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116147552] [2019-12-18 20:46:49,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:46:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:46:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:46:49,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:46:49,243 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:46:49,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_20) (= v_~y~0_23 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_18 0) (= 0 v_~y$w_buff1~0_24) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t621~0.base_27| 4) |v_#length_31|) (= v_~y$r_buff0_thd2~0_71 0) (= 0 v_~y$read_delayed_var~0.base_5) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_27| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_27|) |v_ULTIMATE.start_main_~#t621~0.offset_20| 0)) |v_#memory_int_29|) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t621~0.base_27| 1)) (= 0 v_~weak$$choice2~0_34) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd3~0_28 0) (= v_~y$r_buff0_thd4~0_21 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$w_buff1_used~0_68 0) (= 0 |v_#NULL.base_4|) (= v_~x~0_18 0) (= 0 |v_ULTIMATE.start_main_~#t621~0.offset_20|) (= 0 v_~__unbuffered_cnt~0_27) (= v_~y$w_buff0_used~0_106 0) (= 0 v_~__unbuffered_p3_EBX~0_15) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t621~0.base_27|)) (= 0 v_~y$w_buff0~0_25) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t621~0.base_27|) (= |v_#NULL.offset_4| 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd2~0_42) (= 0 v_~y$r_buff1_thd4~0_18))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_27|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ULTIMATE.start_main_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_18, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_71, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_18, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_~#t621~0.base=|v_ULTIMATE.start_main_~#t621~0.base_27|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_~#t621~0.offset=|v_ULTIMATE.start_main_~#t621~0.offset_20|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_19|, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_42, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_20|, ~z~0=v_~z~0_18, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t622~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t622~0.base, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t623~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t621~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t621~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t624~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t624~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t623~0.offset, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:46:49,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L846-1-->L848: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t622~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t622~0.base_12| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t622~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12|) |v_ULTIMATE.start_main_~#t622~0.offset_10| 1)) |v_#memory_int_17|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t622~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t622~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t622~0.base] because there is no mapped edge [2019-12-18 20:46:49,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L848-1-->L850: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t623~0.base_13| 4) |v_#length_23|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t623~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t623~0.offset_11|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13|) |v_ULTIMATE.start_main_~#t623~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t623~0.base_13|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t623~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t623~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 20:46:49,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd3~0_17 1) (= 1 v_~z~0_6) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff0_thd2~0_46 v_~y$r_buff1_thd2~0_26) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_11) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_46, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:46:49,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L850-1-->L852: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t624~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t624~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t624~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t624~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10|) |v_ULTIMATE.start_main_~#t624~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t624~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t624~0.base, #length] because there is no mapped edge [2019-12-18 20:46:49,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 1 v_~a~0_6) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 20:46:49,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In647540549 256))) (.cse0 (= (mod ~y$r_buff1_thd4~0_In647540549 256) 0))) (or (and (= ~y$w_buff1~0_In647540549 |P3Thread1of1ForFork0_#t~ite32_Out647540549|) (not .cse0) (not .cse1)) (and (= ~y~0_In647540549 |P3Thread1of1ForFork0_#t~ite32_Out647540549|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In647540549, ~y$w_buff1~0=~y$w_buff1~0_In647540549, ~y~0=~y~0_In647540549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In647540549} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In647540549, ~y$w_buff1~0=~y$w_buff1~0_In647540549, ~y~0=~y~0_In647540549, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out647540549|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In647540549} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:46:49,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_17 |v_P3Thread1of1ForFork0_#t~ite32_8|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_8|} OutVars{~y~0=v_~y~0_17, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_7|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_7|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 20:46:49,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2084055893 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In2084055893 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out2084055893| ~y$w_buff0_used~0_In2084055893) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out2084055893|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2084055893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2084055893} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2084055893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2084055893, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out2084055893|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 20:46:49,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In239802581 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In239802581 256)))) (or (= (mod ~y$w_buff0_used~0_In239802581 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In239802581 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In239802581 256) 0)))) .cse1 (= |P1Thread1of1ForFork2_#t~ite8_Out239802581| ~y$w_buff0~0_In239802581) (= |P1Thread1of1ForFork2_#t~ite9_Out239802581| |P1Thread1of1ForFork2_#t~ite8_Out239802581|)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out239802581| ~y$w_buff0~0_In239802581) (= |P1Thread1of1ForFork2_#t~ite8_In239802581| |P1Thread1of1ForFork2_#t~ite8_Out239802581|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In239802581, ~y$w_buff0_used~0=~y$w_buff0_used~0_In239802581, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In239802581|, ~y$w_buff0~0=~y$w_buff0~0_In239802581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In239802581, ~weak$$choice2~0=~weak$$choice2~0_In239802581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In239802581} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In239802581, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out239802581|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In239802581, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out239802581|, ~y$w_buff0~0=~y$w_buff0~0_In239802581, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In239802581, ~weak$$choice2~0=~weak$$choice2~0_In239802581, ~y$w_buff1_used~0=~y$w_buff1_used~0_In239802581} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 20:46:49,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-163555856 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite14_Out-163555856| |P1Thread1of1ForFork2_#t~ite15_Out-163555856|) (= ~y$w_buff0_used~0_In-163555856 |P1Thread1of1ForFork2_#t~ite14_Out-163555856|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-163555856 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-163555856 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-163555856 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-163555856 256)) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite14_In-163555856| |P1Thread1of1ForFork2_#t~ite14_Out-163555856|) (not .cse0) (= ~y$w_buff0_used~0_In-163555856 |P1Thread1of1ForFork2_#t~ite15_Out-163555856|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-163555856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-163555856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-163555856, ~weak$$choice2~0=~weak$$choice2~0_In-163555856, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-163555856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-163555856} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-163555856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-163555856, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-163555856, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-163555856|, ~weak$$choice2~0=~weak$$choice2~0_In-163555856, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-163555856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-163555856} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:46:49,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff0_thd2~0_56) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 20:46:49,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L769-->L769-8: Formula: (let ((.cse4 (= (mod ~y$w_buff0_used~0_In889854444 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out889854444| |P1Thread1of1ForFork2_#t~ite23_Out889854444|)) (.cse1 (= (mod ~weak$$choice2~0_In889854444 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In889854444 256) 0)) (.cse5 (= (mod ~y$w_buff1_used~0_In889854444 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In889854444 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite22_In889854444| |P1Thread1of1ForFork2_#t~ite22_Out889854444|) (or (and .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5)) (= ~y$r_buff1_thd2~0_In889854444 |P1Thread1of1ForFork2_#t~ite23_Out889854444|)) (and (= |P1Thread1of1ForFork2_#t~ite23_In889854444| |P1Thread1of1ForFork2_#t~ite23_Out889854444|) (not .cse1) (= ~y$r_buff1_thd2~0_In889854444 |P1Thread1of1ForFork2_#t~ite24_Out889854444|)))) (let ((.cse6 (not .cse2))) (and (not .cse4) .cse0 .cse1 (or (not .cse3) .cse6) (or .cse6 (not .cse5)) (= 0 |P1Thread1of1ForFork2_#t~ite22_Out889854444|) (= |P1Thread1of1ForFork2_#t~ite23_Out889854444| |P1Thread1of1ForFork2_#t~ite22_Out889854444|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In889854444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In889854444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In889854444, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_In889854444|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In889854444|, ~weak$$choice2~0=~weak$$choice2~0_In889854444, ~y$w_buff1_used~0=~y$w_buff1_used~0_In889854444} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In889854444, ~y$w_buff0_used~0=~y$w_buff0_used~0_In889854444, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In889854444, P1Thread1of1ForFork2_#t~ite22=|P1Thread1of1ForFork2_#t~ite22_Out889854444|, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out889854444|, ~weak$$choice2~0=~weak$$choice2~0_In889854444, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out889854444|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In889854444} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite22, P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 20:46:49,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In322222239 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In322222239 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In322222239 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In322222239 256) 0))) (or (and (= ~y$w_buff1_used~0_In322222239 |P3Thread1of1ForFork0_#t~ite35_Out322222239|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out322222239|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In322222239, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In322222239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In322222239, ~y$w_buff1_used~0=~y$w_buff1_used~0_In322222239} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In322222239, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In322222239, ~y$w_buff0_used~0=~y$w_buff0_used~0_In322222239, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out322222239|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In322222239} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 20:46:49,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_14 v_~y$mem_tmp~0_4)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:46:49,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2094261384 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2094261384 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2094261384 |P2Thread1of1ForFork3_#t~ite28_Out-2094261384|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-2094261384|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094261384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2094261384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2094261384, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2094261384, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-2094261384|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 20:46:49,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1433214705 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1433214705 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1433214705 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1433214705 256)))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1433214705| ~y$w_buff1_used~0_In-1433214705) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork3_#t~ite29_Out-1433214705| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1433214705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1433214705, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1433214705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1433214705} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1433214705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1433214705, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1433214705, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1433214705|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1433214705} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 20:46:49,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1887019070 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1887019070 256) 0))) (or (and (= 0 ~y$r_buff0_thd3~0_Out1887019070) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In1887019070 ~y$r_buff0_thd3~0_Out1887019070)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1887019070, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1887019070} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1887019070|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1887019070, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1887019070} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 20:46:49,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-213397903 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-213397903 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-213397903 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-213397903 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-213397903 |P2Thread1of1ForFork3_#t~ite31_Out-213397903|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-213397903|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-213397903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-213397903, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-213397903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-213397903} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-213397903, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-213397903, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-213397903, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-213397903|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-213397903} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 20:46:49,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L804-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_16)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 20:46:49,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1487528410 256))) (.cse0 (= (mod ~y$r_buff0_thd4~0_In-1487528410 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-1487528410| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-1487528410| ~y$r_buff0_thd4~0_In-1487528410)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1487528410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1487528410} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1487528410, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1487528410, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1487528410|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 20:46:49,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In153089163 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In153089163 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In153089163 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In153089163 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out153089163|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd4~0_In153089163 |P3Thread1of1ForFork0_#t~ite37_Out153089163|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In153089163, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In153089163, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153089163, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153089163} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In153089163, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In153089163, ~y$w_buff0_used~0=~y$w_buff0_used~0_In153089163, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out153089163|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In153089163} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 20:46:49,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L827-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_13)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_13, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:46:49,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:46:49,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In659540549 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In659540549 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite43_Out659540549| |ULTIMATE.start_main_#t~ite42_Out659540549|))) (or (and (= ~y$w_buff1~0_In659540549 |ULTIMATE.start_main_#t~ite42_Out659540549|) (not .cse0) (not .cse1) .cse2) (and (= ~y~0_In659540549 |ULTIMATE.start_main_#t~ite42_Out659540549|) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In659540549, ~y~0=~y~0_In659540549, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In659540549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659540549} OutVars{~y$w_buff1~0=~y$w_buff1~0_In659540549, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out659540549|, ~y~0=~y~0_In659540549, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out659540549|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In659540549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In659540549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:46:49,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In807477020 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In807477020 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out807477020| ~y$w_buff0_used~0_In807477020)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out807477020| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In807477020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In807477020} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In807477020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In807477020, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out807477020|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:46:49,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In625742008 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In625742008 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In625742008 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In625742008 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out625742008| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out625742008| ~y$w_buff1_used~0_In625742008) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In625742008, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In625742008, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In625742008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In625742008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In625742008, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In625742008, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In625742008, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out625742008|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In625742008} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:46:49,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2007006515 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2007006515 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In2007006515 |ULTIMATE.start_main_#t~ite46_Out2007006515|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite46_Out2007006515|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2007006515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2007006515} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2007006515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2007006515, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2007006515|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 20:46:49,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-545641338 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-545641338 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-545641338 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-545641338 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-545641338| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-545641338| ~y$r_buff1_thd0~0_In-545641338)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-545641338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-545641338, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545641338, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545641338} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-545641338, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-545641338, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-545641338|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-545641338, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-545641338} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 20:46:49,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~z~0_11 2) (= 2 v_~__unbuffered_p1_EAX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 2 v_~__unbuffered_p3_EAX~0_8) (= 0 v_~__unbuffered_p3_EBX~0_8) (= |v_ULTIMATE.start_main_#t~ite47_13| v_~y$r_buff1_thd0~0_17) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z~0=v_~z~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:46:49,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:46:49 BasicIcfg [2019-12-18 20:46:49,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:46:49,400 INFO L168 Benchmark]: Toolchain (without parser) took 109453.24 ms. Allocated memory was 145.2 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 100.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-18 20:46:49,401 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 20:46:49,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 876.02 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 156.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:49,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.24 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:49,404 INFO L168 Benchmark]: Boogie Preprocessor took 50.36 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:49,405 INFO L168 Benchmark]: RCFGBuilder took 829.64 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 103.2 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:46:49,406 INFO L168 Benchmark]: TraceAbstraction took 107619.04 ms. Allocated memory was 202.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 102.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 20:46:49,414 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.17 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 876.02 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.8 MB in the beginning and 156.9 MB in the end (delta: -57.2 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.24 ms. Allocated memory is still 202.9 MB. Free memory was 156.9 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.36 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.64 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 103.2 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 107619.04 ms. Allocated memory was 202.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 102.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 7815 VarBasedMoverChecksPositive, 199 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68763 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t621, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t622, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t623, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L852] FCALL, FORK 0 pthread_create(&t624, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 107.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3671 SDtfs, 5374 SDslu, 8944 SDs, 0 SdLazy, 3778 SolverSat, 333 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166438occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 163575 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 814 ConstructedInterpolants, 0 QuantifiedInterpolants, 110190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...