/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/mix011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:17:40,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:17:40,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:17:40,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:17:40,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:17:40,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:17:40,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:17:40,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:17:40,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:17:40,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:17:40,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:17:40,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:17:40,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:17:40,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:17:40,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:17:40,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:17:40,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:17:40,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:17:40,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:17:40,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:17:40,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:17:40,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:17:40,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:17:40,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:17:40,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:17:40,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:17:40,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:17:40,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:17:40,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:17:40,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:17:40,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:17:40,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:17:40,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:17:40,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:17:40,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:17:40,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:17:40,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:17:40,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:17:40,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:17:40,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:17:40,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:17:40,855 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:17:40,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:17:40,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:17:40,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:17:40,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:17:40,877 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:17:40,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:17:40,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:17:40,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:17:40,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:17:40,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:17:40,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:17:40,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:17:40,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:17:40,880 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:17:40,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:17:40,881 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:17:40,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:17:40,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:17:40,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:17:40,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:17:40,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:17:40,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:17:40,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:17:40,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:17:40,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:17:40,883 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:17:40,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:17:40,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:17:40,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:17:40,884 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:17:41,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:17:41,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:17:41,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:17:41,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:17:41,168 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:17:41,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.opt.i [2019-12-18 20:17:41,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37392d0eb/b7874a867eed4c07ba0e501d54ffa771/FLAG3e8d5d254 [2019-12-18 20:17:41,849 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:17:41,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.opt.i [2019-12-18 20:17:41,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37392d0eb/b7874a867eed4c07ba0e501d54ffa771/FLAG3e8d5d254 [2019-12-18 20:17:42,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37392d0eb/b7874a867eed4c07ba0e501d54ffa771 [2019-12-18 20:17:42,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:17:42,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:17:42,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:17:42,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:17:42,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:17:42,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:42,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12c5e056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42, skipping insertion in model container [2019-12-18 20:17:42,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:42,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:17:42,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:17:42,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:17:42,752 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:17:42,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:17:42,908 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:17:42,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42 WrapperNode [2019-12-18 20:17:42,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:17:42,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:17:42,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:17:42,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:17:42,919 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:17:42" (1/1) ... [2019-12-18 20:17:42,947 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:17:42" (1/1) ... [2019-12-18 20:17:42,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:17:42,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:17:42,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:17:42,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:17:42,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:42,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:42,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:42,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:43,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:43,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:43,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (1/1) ... [2019-12-18 20:17:43,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:17:43,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:17:43,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:17:43,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:17:43,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (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:17:43,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:17:43,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:17:43,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:17:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:17:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:17:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:17:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:17:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:17:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:17:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:17:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:17:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:17:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:17:43,138 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:17:44,159 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:17:44,159 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:17:44,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:17:44 BoogieIcfgContainer [2019-12-18 20:17:44,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:17:44,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:17:44,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:17:44,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:17:44,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:17:42" (1/3) ... [2019-12-18 20:17:44,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59994215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:17:44, skipping insertion in model container [2019-12-18 20:17:44,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:17:42" (2/3) ... [2019-12-18 20:17:44,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59994215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:17:44, skipping insertion in model container [2019-12-18 20:17:44,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:17:44" (3/3) ... [2019-12-18 20:17:44,174 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.opt.i [2019-12-18 20:17:44,184 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:17:44,184 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:17:44,196 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:17:44,213 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:17:44,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,286 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,311 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,311 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,341 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,351 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,354 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:17:44,369 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:17:44,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:17:44,389 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:17:44,390 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:17:44,390 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:17:44,390 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:17:44,390 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:17:44,390 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:17:44,390 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:17:44,414 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-18 20:17:44,416 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-18 20:17:44,516 INFO L126 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-18 20:17:44,516 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:17:44,538 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:17:44,572 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-18 20:17:44,634 INFO L126 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-18 20:17:44,634 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:17:44,645 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 20:17:44,675 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 20:17:44,676 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:17:48,581 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 20:17:48,714 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 20:17:48,824 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123784 [2019-12-18 20:17:48,824 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-18 20:17:48,828 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 127 transitions [2019-12-18 20:17:52,061 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42982 states. [2019-12-18 20:17:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 42982 states. [2019-12-18 20:17:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 20:17:52,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:52,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:52,070 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:52,075 INFO L82 PathProgramCache]: Analyzing trace with hash 48878050, now seen corresponding path program 1 times [2019-12-18 20:17:52,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:52,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295100497] [2019-12-18 20:17:52,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:52,311 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:17:52,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295100497] [2019-12-18 20:17:52,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:52,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:17:52,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041745923] [2019-12-18 20:17:52,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:17:52,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:52,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:17:52,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:17:52,336 INFO L87 Difference]: Start difference. First operand 42982 states. Second operand 3 states. [2019-12-18 20:17:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:53,842 INFO L93 Difference]: Finished difference Result 42470 states and 173504 transitions. [2019-12-18 20:17:53,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:17:53,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 20:17:53,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:17:54,433 INFO L225 Difference]: With dead ends: 42470 [2019-12-18 20:17:54,433 INFO L226 Difference]: Without dead ends: 39546 [2019-12-18 20:17:54,434 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:17:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39546 states. [2019-12-18 20:17:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39546 to 39546. [2019-12-18 20:17:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39546 states. [2019-12-18 20:17:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39546 states to 39546 states and 161440 transitions. [2019-12-18 20:17:58,270 INFO L78 Accepts]: Start accepts. Automaton has 39546 states and 161440 transitions. Word has length 7 [2019-12-18 20:17:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:17:58,272 INFO L462 AbstractCegarLoop]: Abstraction has 39546 states and 161440 transitions. [2019-12-18 20:17:58,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:17:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 39546 states and 161440 transitions. [2019-12-18 20:17:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:17:58,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:17:58,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:17:58,287 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:17:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:17:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2064044969, now seen corresponding path program 1 times [2019-12-18 20:17:58,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:17:58,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313033965] [2019-12-18 20:17:58,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:17:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:17:58,450 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:17:58,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313033965] [2019-12-18 20:17:58,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:17:58,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:17:58,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845348004] [2019-12-18 20:17:58,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:17:58,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:17:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:17:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:17:58,454 INFO L87 Difference]: Start difference. First operand 39546 states and 161440 transitions. Second operand 4 states. [2019-12-18 20:17:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:17:59,151 INFO L93 Difference]: Finished difference Result 62606 states and 245680 transitions. [2019-12-18 20:17:59,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:17:59,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:17:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:01,390 INFO L225 Difference]: With dead ends: 62606 [2019-12-18 20:18:01,391 INFO L226 Difference]: Without dead ends: 62574 [2019-12-18 20:18:01,392 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:18:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62574 states. [2019-12-18 20:18:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62574 to 60086. [2019-12-18 20:18:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60086 states. [2019-12-18 20:18:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60086 states to 60086 states and 237688 transitions. [2019-12-18 20:18:03,825 INFO L78 Accepts]: Start accepts. Automaton has 60086 states and 237688 transitions. Word has length 13 [2019-12-18 20:18:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:03,825 INFO L462 AbstractCegarLoop]: Abstraction has 60086 states and 237688 transitions. [2019-12-18 20:18:03,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 60086 states and 237688 transitions. [2019-12-18 20:18:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 20:18:03,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:03,829 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:18:03,830 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:03,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:03,830 INFO L82 PathProgramCache]: Analyzing trace with hash 503175658, now seen corresponding path program 1 times [2019-12-18 20:18:03,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:03,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134273314] [2019-12-18 20:18:03,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:03,908 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:18:03,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134273314] [2019-12-18 20:18:03,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:03,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:03,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883298030] [2019-12-18 20:18:03,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:03,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:03,913 INFO L87 Difference]: Start difference. First operand 60086 states and 237688 transitions. Second operand 4 states. [2019-12-18 20:18:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:06,947 INFO L93 Difference]: Finished difference Result 77526 states and 302124 transitions. [2019-12-18 20:18:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:18:06,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 20:18:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:07,222 INFO L225 Difference]: With dead ends: 77526 [2019-12-18 20:18:07,222 INFO L226 Difference]: Without dead ends: 77496 [2019-12-18 20:18:07,222 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:18:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77496 states. [2019-12-18 20:18:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77496 to 68188. [2019-12-18 20:18:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68188 states. [2019-12-18 20:18:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68188 states to 68188 states and 268551 transitions. [2019-12-18 20:18:09,581 INFO L78 Accepts]: Start accepts. Automaton has 68188 states and 268551 transitions. Word has length 16 [2019-12-18 20:18:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:09,581 INFO L462 AbstractCegarLoop]: Abstraction has 68188 states and 268551 transitions. [2019-12-18 20:18:09,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 68188 states and 268551 transitions. [2019-12-18 20:18:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:18:09,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:09,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:09,590 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:09,590 INFO L82 PathProgramCache]: Analyzing trace with hash -787717565, now seen corresponding path program 1 times [2019-12-18 20:18:09,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:09,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675862668] [2019-12-18 20:18:09,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:09,659 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:18:09,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675862668] [2019-12-18 20:18:09,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:09,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:18:09,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493016764] [2019-12-18 20:18:09,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:09,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:09,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:09,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:09,662 INFO L87 Difference]: Start difference. First operand 68188 states and 268551 transitions. Second operand 3 states. [2019-12-18 20:18:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:10,595 INFO L93 Difference]: Finished difference Result 64048 states and 251839 transitions. [2019-12-18 20:18:10,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:10,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 20:18:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:10,799 INFO L225 Difference]: With dead ends: 64048 [2019-12-18 20:18:10,799 INFO L226 Difference]: Without dead ends: 63856 [2019-12-18 20:18:10,800 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:18:11,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63856 states. [2019-12-18 20:18:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63856 to 63856. [2019-12-18 20:18:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63856 states. [2019-12-18 20:18:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63856 states to 63856 states and 251151 transitions. [2019-12-18 20:18:16,818 INFO L78 Accepts]: Start accepts. Automaton has 63856 states and 251151 transitions. Word has length 18 [2019-12-18 20:18:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:16,819 INFO L462 AbstractCegarLoop]: Abstraction has 63856 states and 251151 transitions. [2019-12-18 20:18:16,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 63856 states and 251151 transitions. [2019-12-18 20:18:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:18:16,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:16,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:16,844 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash -802769487, now seen corresponding path program 1 times [2019-12-18 20:18:16,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:16,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573657959] [2019-12-18 20:18:16,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:16,927 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:18:16,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573657959] [2019-12-18 20:18:16,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:16,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:16,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985386172] [2019-12-18 20:18:16,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:16,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:16,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:16,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:16,929 INFO L87 Difference]: Start difference. First operand 63856 states and 251151 transitions. Second operand 5 states. [2019-12-18 20:18:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:17,857 INFO L93 Difference]: Finished difference Result 77072 states and 298885 transitions. [2019-12-18 20:18:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:18:17,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 20:18:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:18,055 INFO L225 Difference]: With dead ends: 77072 [2019-12-18 20:18:18,056 INFO L226 Difference]: Without dead ends: 77018 [2019-12-18 20:18:18,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:19,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77018 states. [2019-12-18 20:18:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77018 to 63662. [2019-12-18 20:18:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63662 states. [2019-12-18 20:18:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63662 states to 63662 states and 250434 transitions. [2019-12-18 20:18:22,832 INFO L78 Accepts]: Start accepts. Automaton has 63662 states and 250434 transitions. Word has length 22 [2019-12-18 20:18:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:22,833 INFO L462 AbstractCegarLoop]: Abstraction has 63662 states and 250434 transitions. [2019-12-18 20:18:22,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 63662 states and 250434 transitions. [2019-12-18 20:18:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 20:18:22,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:22,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:22,909 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash -655538281, now seen corresponding path program 1 times [2019-12-18 20:18:22,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:22,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891246909] [2019-12-18 20:18:22,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:22,983 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:18:22,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891246909] [2019-12-18 20:18:22,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:22,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:18:22,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495052503] [2019-12-18 20:18:22,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:22,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:22,985 INFO L87 Difference]: Start difference. First operand 63662 states and 250434 transitions. Second operand 3 states. [2019-12-18 20:18:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:23,257 INFO L93 Difference]: Finished difference Result 63610 states and 250254 transitions. [2019-12-18 20:18:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:23,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 20:18:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:23,946 INFO L225 Difference]: With dead ends: 63610 [2019-12-18 20:18:23,946 INFO L226 Difference]: Without dead ends: 63610 [2019-12-18 20:18:23,947 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:18:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63610 states. [2019-12-18 20:18:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63610 to 63610. [2019-12-18 20:18:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63610 states. [2019-12-18 20:18:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63610 states to 63610 states and 250254 transitions. [2019-12-18 20:18:25,956 INFO L78 Accepts]: Start accepts. Automaton has 63610 states and 250254 transitions. Word has length 32 [2019-12-18 20:18:25,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:25,957 INFO L462 AbstractCegarLoop]: Abstraction has 63610 states and 250254 transitions. [2019-12-18 20:18:25,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:25,957 INFO L276 IsEmpty]: Start isEmpty. Operand 63610 states and 250254 transitions. [2019-12-18 20:18:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 20:18:26,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:26,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:26,023 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash -33493824, now seen corresponding path program 1 times [2019-12-18 20:18:26,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:26,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352833160] [2019-12-18 20:18:26,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:26,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:18:26,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352833160] [2019-12-18 20:18:26,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:26,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:26,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226728019] [2019-12-18 20:18:26,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:26,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:26,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:26,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:26,112 INFO L87 Difference]: Start difference. First operand 63610 states and 250254 transitions. Second operand 4 states. [2019-12-18 20:18:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:26,272 INFO L93 Difference]: Finished difference Result 39471 states and 135697 transitions. [2019-12-18 20:18:26,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:26,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 20:18:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:26,336 INFO L225 Difference]: With dead ends: 39471 [2019-12-18 20:18:26,336 INFO L226 Difference]: Without dead ends: 35301 [2019-12-18 20:18:26,337 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:18:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35301 states. [2019-12-18 20:18:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35301 to 35301. [2019-12-18 20:18:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35301 states. [2019-12-18 20:18:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 121237 transitions. [2019-12-18 20:18:27,809 INFO L78 Accepts]: Start accepts. Automaton has 35301 states and 121237 transitions. Word has length 33 [2019-12-18 20:18:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:27,809 INFO L462 AbstractCegarLoop]: Abstraction has 35301 states and 121237 transitions. [2019-12-18 20:18:27,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35301 states and 121237 transitions. [2019-12-18 20:18:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 20:18:27,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:27,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:18:27,851 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash 85671784, now seen corresponding path program 1 times [2019-12-18 20:18:27,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:27,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528403143] [2019-12-18 20:18:27,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:27,926 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:18:27,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528403143] [2019-12-18 20:18:27,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:27,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:27,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460438143] [2019-12-18 20:18:27,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:27,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:27,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:27,929 INFO L87 Difference]: Start difference. First operand 35301 states and 121237 transitions. Second operand 3 states. [2019-12-18 20:18:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:28,054 INFO L93 Difference]: Finished difference Result 35301 states and 119691 transitions. [2019-12-18 20:18:28,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:28,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 20:18:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:28,118 INFO L225 Difference]: With dead ends: 35301 [2019-12-18 20:18:28,119 INFO L226 Difference]: Without dead ends: 35301 [2019-12-18 20:18:28,119 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:18:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35301 states. [2019-12-18 20:18:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35301 to 35044. [2019-12-18 20:18:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35044 states. [2019-12-18 20:18:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35044 states to 35044 states and 118927 transitions. [2019-12-18 20:18:30,673 INFO L78 Accepts]: Start accepts. Automaton has 35044 states and 118927 transitions. Word has length 34 [2019-12-18 20:18:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:30,673 INFO L462 AbstractCegarLoop]: Abstraction has 35044 states and 118927 transitions. [2019-12-18 20:18:30,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand 35044 states and 118927 transitions. [2019-12-18 20:18:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:18:30,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:30,715 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] [2019-12-18 20:18:30,716 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash -457919437, now seen corresponding path program 1 times [2019-12-18 20:18:30,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:30,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283291617] [2019-12-18 20:18:30,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:30,801 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:18:30,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283291617] [2019-12-18 20:18:30,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:30,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:18:30,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366665702] [2019-12-18 20:18:30,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:18:30,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:30,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:18:30,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:18:30,803 INFO L87 Difference]: Start difference. First operand 35044 states and 118927 transitions. Second operand 7 states. [2019-12-18 20:18:31,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:31,879 INFO L93 Difference]: Finished difference Result 86980 states and 295066 transitions. [2019-12-18 20:18:31,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:18:31,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 20:18:31,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:32,016 INFO L225 Difference]: With dead ends: 86980 [2019-12-18 20:18:32,016 INFO L226 Difference]: Without dead ends: 72221 [2019-12-18 20:18:32,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:18:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72221 states. [2019-12-18 20:18:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72221 to 56906. [2019-12-18 20:18:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56906 states. [2019-12-18 20:18:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56906 states to 56906 states and 195291 transitions. [2019-12-18 20:18:33,638 INFO L78 Accepts]: Start accepts. Automaton has 56906 states and 195291 transitions. Word has length 35 [2019-12-18 20:18:33,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:33,638 INFO L462 AbstractCegarLoop]: Abstraction has 56906 states and 195291 transitions. [2019-12-18 20:18:33,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:18:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 56906 states and 195291 transitions. [2019-12-18 20:18:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 20:18:33,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:33,707 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] [2019-12-18 20:18:33,707 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1816227805, now seen corresponding path program 2 times [2019-12-18 20:18:33,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:33,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771491484] [2019-12-18 20:18:33,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:33,856 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:18:33,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771491484] [2019-12-18 20:18:33,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:33,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:18:33,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278303008] [2019-12-18 20:18:33,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:33,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:33,858 INFO L87 Difference]: Start difference. First operand 56906 states and 195291 transitions. Second operand 8 states. [2019-12-18 20:18:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:35,266 INFO L93 Difference]: Finished difference Result 102985 states and 356112 transitions. [2019-12-18 20:18:35,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 20:18:35,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-18 20:18:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:35,476 INFO L225 Difference]: With dead ends: 102985 [2019-12-18 20:18:35,476 INFO L226 Difference]: Without dead ends: 98281 [2019-12-18 20:18:35,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-18 20:18:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98281 states. [2019-12-18 20:18:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98281 to 56716. [2019-12-18 20:18:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56716 states. [2019-12-18 20:18:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56716 states to 56716 states and 194718 transitions. [2019-12-18 20:18:37,657 INFO L78 Accepts]: Start accepts. Automaton has 56716 states and 194718 transitions. Word has length 35 [2019-12-18 20:18:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:37,657 INFO L462 AbstractCegarLoop]: Abstraction has 56716 states and 194718 transitions. [2019-12-18 20:18:37,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 56716 states and 194718 transitions. [2019-12-18 20:18:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 20:18:37,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:37,715 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] [2019-12-18 20:18:37,715 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 700182320, now seen corresponding path program 1 times [2019-12-18 20:18:37,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:37,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021328788] [2019-12-18 20:18:37,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:37,795 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:18:37,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021328788] [2019-12-18 20:18:37,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:37,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:18:37,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134284513] [2019-12-18 20:18:37,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:18:37,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:18:37,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:18:37,798 INFO L87 Difference]: Start difference. First operand 56716 states and 194718 transitions. Second operand 5 states. [2019-12-18 20:18:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:37,871 INFO L93 Difference]: Finished difference Result 10199 states and 31585 transitions. [2019-12-18 20:18:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:18:37,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-18 20:18:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:37,883 INFO L225 Difference]: With dead ends: 10199 [2019-12-18 20:18:37,883 INFO L226 Difference]: Without dead ends: 7219 [2019-12-18 20:18:37,883 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:18:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7219 states. [2019-12-18 20:18:37,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7219 to 7219. [2019-12-18 20:18:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7219 states. [2019-12-18 20:18:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7219 states to 7219 states and 21075 transitions. [2019-12-18 20:18:37,973 INFO L78 Accepts]: Start accepts. Automaton has 7219 states and 21075 transitions. Word has length 36 [2019-12-18 20:18:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:37,973 INFO L462 AbstractCegarLoop]: Abstraction has 7219 states and 21075 transitions. [2019-12-18 20:18:37,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:18:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 7219 states and 21075 transitions. [2019-12-18 20:18:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 20:18:37,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:37,981 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] [2019-12-18 20:18:37,981 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:37,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:37,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1368466382, now seen corresponding path program 1 times [2019-12-18 20:18:37,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:37,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491619211] [2019-12-18 20:18:37,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:38,046 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:18:38,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491619211] [2019-12-18 20:18:38,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:38,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:18:38,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734613332] [2019-12-18 20:18:38,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:18:38,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:38,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:18:38,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:18:38,048 INFO L87 Difference]: Start difference. First operand 7219 states and 21075 transitions. Second operand 4 states. [2019-12-18 20:18:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:38,093 INFO L93 Difference]: Finished difference Result 8268 states and 23454 transitions. [2019-12-18 20:18:38,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:18:38,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 20:18:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:38,106 INFO L225 Difference]: With dead ends: 8268 [2019-12-18 20:18:38,106 INFO L226 Difference]: Without dead ends: 7230 [2019-12-18 20:18:38,107 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:18:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2019-12-18 20:18:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 7213. [2019-12-18 20:18:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7213 states. [2019-12-18 20:18:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7213 states to 7213 states and 20991 transitions. [2019-12-18 20:18:38,250 INFO L78 Accepts]: Start accepts. Automaton has 7213 states and 20991 transitions. Word has length 47 [2019-12-18 20:18:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:38,250 INFO L462 AbstractCegarLoop]: Abstraction has 7213 states and 20991 transitions. [2019-12-18 20:18:38,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:18:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7213 states and 20991 transitions. [2019-12-18 20:18:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 20:18:38,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:38,262 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] [2019-12-18 20:18:38,263 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash -82607882, now seen corresponding path program 2 times [2019-12-18 20:18:38,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:38,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352643185] [2019-12-18 20:18:38,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:38,313 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:18:38,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352643185] [2019-12-18 20:18:38,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:38,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:18:38,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603339657] [2019-12-18 20:18:38,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:18:38,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:38,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:18:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:18:38,315 INFO L87 Difference]: Start difference. First operand 7213 states and 20991 transitions. Second operand 3 states. [2019-12-18 20:18:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:38,357 INFO L93 Difference]: Finished difference Result 11168 states and 30807 transitions. [2019-12-18 20:18:38,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:18:38,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 20:18:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:38,370 INFO L225 Difference]: With dead ends: 11168 [2019-12-18 20:18:38,371 INFO L226 Difference]: Without dead ends: 7027 [2019-12-18 20:18:38,371 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:18:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7027 states. [2019-12-18 20:18:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7027 to 7002. [2019-12-18 20:18:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7002 states. [2019-12-18 20:18:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 17669 transitions. [2019-12-18 20:18:38,488 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 17669 transitions. Word has length 47 [2019-12-18 20:18:38,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:38,488 INFO L462 AbstractCegarLoop]: Abstraction has 7002 states and 17669 transitions. [2019-12-18 20:18:38,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:18:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 17669 transitions. [2019-12-18 20:18:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 20:18:38,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:38,497 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] [2019-12-18 20:18:38,498 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:38,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:38,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1179496772, now seen corresponding path program 3 times [2019-12-18 20:18:38,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:38,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596939832] [2019-12-18 20:18:38,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:38,590 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:18:38,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596939832] [2019-12-18 20:18:38,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:38,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:18:38,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821800545] [2019-12-18 20:18:38,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:18:38,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:38,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:18:38,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:18:38,592 INFO L87 Difference]: Start difference. First operand 7002 states and 17669 transitions. Second operand 6 states. [2019-12-18 20:18:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:38,662 INFO L93 Difference]: Finished difference Result 5853 states and 15054 transitions. [2019-12-18 20:18:38,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:18:38,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 20:18:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:38,663 INFO L225 Difference]: With dead ends: 5853 [2019-12-18 20:18:38,663 INFO L226 Difference]: Without dead ends: 435 [2019-12-18 20:18:38,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:18:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-18 20:18:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-12-18 20:18:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-18 20:18:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 952 transitions. [2019-12-18 20:18:38,670 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 952 transitions. Word has length 47 [2019-12-18 20:18:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:38,670 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 952 transitions. [2019-12-18 20:18:38,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:18:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 952 transitions. [2019-12-18 20:18:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 20:18:38,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:38,671 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, 1, 1, 1, 1] [2019-12-18 20:18:38,671 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:38,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1909019652, now seen corresponding path program 1 times [2019-12-18 20:18:38,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:38,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252888454] [2019-12-18 20:18:38,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:18:38,762 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:18:38,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252888454] [2019-12-18 20:18:38,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:18:38,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:18:38,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573773425] [2019-12-18 20:18:38,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:18:38,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:18:38,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:18:38,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:18:38,764 INFO L87 Difference]: Start difference. First operand 435 states and 952 transitions. Second operand 8 states. [2019-12-18 20:18:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:18:39,050 INFO L93 Difference]: Finished difference Result 1207 states and 2632 transitions. [2019-12-18 20:18:39,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:18:39,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 20:18:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:18:39,052 INFO L225 Difference]: With dead ends: 1207 [2019-12-18 20:18:39,053 INFO L226 Difference]: Without dead ends: 964 [2019-12-18 20:18:39,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 20:18:39,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-12-18 20:18:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 521. [2019-12-18 20:18:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-12-18 20:18:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1141 transitions. [2019-12-18 20:18:39,072 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1141 transitions. Word has length 63 [2019-12-18 20:18:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:18:39,073 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 1141 transitions. [2019-12-18 20:18:39,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:18:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1141 transitions. [2019-12-18 20:18:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 20:18:39,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:18:39,075 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, 1, 1, 1, 1] [2019-12-18 20:18:39,075 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:18:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:18:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1974293500, now seen corresponding path program 2 times [2019-12-18 20:18:39,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:18:39,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61626247] [2019-12-18 20:18:39,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:18:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:18:39,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:18:39,366 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:18:39,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t284~0.base_27|) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~main$tmp_guard1~0_18 0) (= v_~z$r_buff0_thd3~0_78 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t284~0.base_27|)) (= |v_ULTIMATE.start_main_~#t284~0.offset_21| 0) (= 0 v_~z$r_buff1_thd2~0_28) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z~0_26 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t284~0.base_27| 1)) (= 0 v_~z$w_buff1~0_35) (= v_~x~0_15 0) (= 0 v_~y~0_7) (= v_~__unbuffered_p2_EBX~0_12 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_134 0) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_54 0) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_9 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_27|) |v_ULTIMATE.start_main_~#t284~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~__unbuffered_p2_EAX~0_12) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t284~0.base_27| 4)) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff1_used~0_71) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~z$w_buff0~0_35))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_28, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_18|, ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ULTIMATE.start_main_~#t284~0.base=|v_ULTIMATE.start_main_~#t284~0.base_27|, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t284~0.offset=|v_ULTIMATE.start_main_~#t284~0.offset_21|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_134, ~z$w_buff0~0=v_~z$w_buff0~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t286~0.offset, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t285~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t284~0.base, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t284~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t286~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:18:39,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t285~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10|) |v_ULTIMATE.start_main_~#t285~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t285~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t285~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t285~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_9|, ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.offset, ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:18:39,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t286~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t286~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11|) |v_ULTIMATE.start_main_~#t286~0.offset_10| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t286~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t286~0.base, #length, ULTIMATE.start_main_~#t286~0.offset] because there is no mapped edge [2019-12-18 20:18:39,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_53 256)) (= 1 v_~z$w_buff0~0_24) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0_used~0_99 1) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_53) (= v_~z$w_buff0~0_25 v_~z$w_buff1~0_22) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_24, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ~z$w_buff1~0=v_~z$w_buff1~0_22, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 20:18:39,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out2008631578| |P2Thread1of1ForFork0_#t~ite28_Out2008631578|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2008631578 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In2008631578 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out2008631578| ~z$w_buff1~0_In2008631578)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out2008631578| ~z$w_buff0~0_In2008631578) (not .cse1) (not .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In2008631578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2008631578, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2008631578, ~z$w_buff1~0=~z$w_buff1~0_In2008631578} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out2008631578|, ~z$w_buff0~0=~z$w_buff0~0_In2008631578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2008631578, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2008631578, ~z$w_buff1~0=~z$w_buff1~0_In2008631578, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out2008631578|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 20:18:39,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 20:18:39,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1357760250 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-1357760250| ~z$mem_tmp~0_In-1357760250)) (and (= ~z~0_In-1357760250 |P2Thread1of1ForFork0_#t~ite48_Out-1357760250|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1357760250, ~z$flush_delayed~0=~z$flush_delayed~0_In-1357760250, ~z~0=~z~0_In-1357760250} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1357760250|, ~z$mem_tmp~0=~z$mem_tmp~0_In-1357760250, ~z$flush_delayed~0=~z$flush_delayed~0_In-1357760250, ~z~0=~z~0_In-1357760250} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 20:18:39,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, 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_15, 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:18:39,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1269564139 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1269564139 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-1269564139| 0)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1269564139| ~z$w_buff0_used~0_In-1269564139) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1269564139, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1269564139} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1269564139, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1269564139, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1269564139|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 20:18:39,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1226677822 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1226677822 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1226677822 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1226677822 256) 0))) (or (and (= ~z$w_buff1_used~0_In1226677822 |P2Thread1of1ForFork0_#t~ite52_Out1226677822|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1226677822|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1226677822, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1226677822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1226677822, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1226677822} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1226677822, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1226677822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1226677822, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1226677822|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1226677822} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 20:18:39,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1332154052 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1332154052 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1332154052 ~z$r_buff0_thd3~0_Out-1332154052)) (and (= 0 ~z$r_buff0_thd3~0_Out-1332154052) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1332154052, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1332154052} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1332154052, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1332154052, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1332154052|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 20:18:39,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In1964899167 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1964899167 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1964899167 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1964899167 256)))) (or (and (= ~z$r_buff1_thd3~0_In1964899167 |P2Thread1of1ForFork0_#t~ite54_Out1964899167|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1964899167|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1964899167, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1964899167, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964899167, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964899167} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1964899167, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1964899167|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1964899167, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1964899167, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1964899167} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 20:18:39,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_37 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 20:18:39,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In445654196 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In445654196 |P1Thread1of1ForFork2_#t~ite25_Out445654196|)) (and (= ~z~0_In445654196 |P1Thread1of1ForFork2_#t~ite25_Out445654196|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In445654196, ~z$flush_delayed~0=~z$flush_delayed~0_In445654196, ~z~0=~z~0_In445654196} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In445654196, ~z$flush_delayed~0=~z$flush_delayed~0_In445654196, ~z~0=~z~0_In445654196, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out445654196|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:18:39,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L771-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_23) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 20:18:39,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$w_buff0_used~0_94 256)) (= 0 (mod v_~z$r_buff0_thd0~0_14 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:18:39,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite58_Out1395010309| |ULTIMATE.start_main_#t~ite59_Out1395010309|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1395010309 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1395010309 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out1395010309| ~z$w_buff1~0_In1395010309) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite58_Out1395010309| ~z~0_In1395010309) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1395010309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1395010309, ~z$w_buff1~0=~z$w_buff1~0_In1395010309, ~z~0=~z~0_In1395010309} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1395010309, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1395010309|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1395010309, ~z$w_buff1~0=~z$w_buff1~0_In1395010309, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1395010309|, ~z~0=~z~0_In1395010309} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:18:39,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-398308658 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-398308658 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-398308658| ~z$w_buff0_used~0_In-398308658)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-398308658| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-398308658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-398308658} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-398308658|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-398308658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-398308658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 20:18:39,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1576821571 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1576821571 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1576821571 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1576821571 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1576821571| ~z$w_buff1_used~0_In1576821571) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite61_Out1576821571| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1576821571, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1576821571, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1576821571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1576821571} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1576821571, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1576821571|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1576821571, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1576821571, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1576821571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:18:39,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1456262512 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1456262512 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-1456262512| ~z$r_buff0_thd0~0_In-1456262512) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-1456262512| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1456262512, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1456262512} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1456262512|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1456262512, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1456262512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:18:39,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-127560694 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-127560694 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-127560694 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-127560694 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-127560694|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-127560694 |ULTIMATE.start_main_#t~ite63_Out-127560694|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-127560694, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-127560694, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-127560694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-127560694} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-127560694|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-127560694, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-127560694, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-127560694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-127560694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 20:18:39,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_13 0) (= |v_ULTIMATE.start_main_#t~ite63_10| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:18:39,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:18:39 BasicIcfg [2019-12-18 20:18:39,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:18:39,622 INFO L168 Benchmark]: Toolchain (without parser) took 57516.25 ms. Allocated memory was 146.3 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 102.3 MB in the beginning and 705.8 MB in the end (delta: -603.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 20:18:39,624 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:18:39,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.60 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 156.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:39,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.23 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 153.8 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:18:39,632 INFO L168 Benchmark]: Boogie Preprocessor took 39.42 ms. Allocated memory is still 203.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:39,633 INFO L168 Benchmark]: RCFGBuilder took 1137.82 ms. Allocated memory is still 203.9 MB. Free memory was 151.2 MB in the beginning and 95.5 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:18:39,634 INFO L168 Benchmark]: TraceAbstraction took 55456.44 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 94.9 MB in the beginning and 705.8 MB in the end (delta: -610.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 20:18:39,642 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.42 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.60 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 156.5 MB in the end (delta: -54.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.23 ms. Allocated memory is still 203.9 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.42 ms. Allocated memory is still 203.9 MB. Free memory was 153.8 MB in the beginning and 151.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1137.82 ms. Allocated memory is still 203.9 MB. Free memory was 151.2 MB in the beginning and 95.5 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55456.44 ms. Allocated memory was 203.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 94.9 MB in the beginning and 705.8 MB in the end (delta: -610.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 196 ProgramPointsBefore, 106 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 8644 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 123784 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 54.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3312 SDtfs, 4424 SDslu, 6729 SDs, 0 SdLazy, 1921 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68188occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 82774 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 51406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...