/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:08:55,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:08:55,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:08:55,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:08:55,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:08:55,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:08:55,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:08:55,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:08:55,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:08:55,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:08:55,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:08:55,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:08:55,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:08:55,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:08:55,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:08:55,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:08:55,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:08:55,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:08:55,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:08:55,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:08:55,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:08:55,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:08:55,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:08:55,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:08:55,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:08:55,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:08:55,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:08:55,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:08:55,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:08:55,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:08:55,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:08:55,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:08:55,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:08:55,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:08:55,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:08:55,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:08:55,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:08:55,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:08:55,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:08:55,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:08:55,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:08:55,999 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-SemanticLbe.epf [2019-12-18 16:08:56,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:08:56,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:08:56,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:08:56,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:08:56,038 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:08:56,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:08:56,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:08:56,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:08:56,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:08:56,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:08:56,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:08:56,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:08:56,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:08:56,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:08:56,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:08:56,042 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:08:56,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:08:56,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:08:56,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:08:56,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:08:56,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:08:56,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:08:56,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:08:56,046 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:08:56,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:08:56,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:08:56,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:08:56,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:08:56,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:08:56,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:08:56,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:08:56,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:08:56,341 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:08:56,341 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:08:56,342 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_rmo.opt.i [2019-12-18 16:08:56,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7919f6c72/6348638cb9f5410f80d28337230270c4/FLAGc83923f44 [2019-12-18 16:08:56,982 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:08:56,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_rmo.opt.i [2019-12-18 16:08:56,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7919f6c72/6348638cb9f5410f80d28337230270c4/FLAGc83923f44 [2019-12-18 16:08:57,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7919f6c72/6348638cb9f5410f80d28337230270c4 [2019-12-18 16:08:57,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:08:57,273 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:08:57,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:08:57,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:08:57,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:08:57,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:08:57" (1/1) ... [2019-12-18 16:08:57,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad36765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:57, skipping insertion in model container [2019-12-18 16:08:57,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:08:57" (1/1) ... [2019-12-18 16:08:57,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:08:57,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:08:57,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:08:57,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:08:58,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:08:58,104 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:08:58,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58 WrapperNode [2019-12-18 16:08:58,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:08:58,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:08:58,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:08:58,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:08:58,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:08:58,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:08:58,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:08:58,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:08:58,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (1/1) ... [2019-12-18 16:08:58,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:08:58,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:08:58,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:08:58,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:08:58,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (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 16:08:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:08:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:08:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:08:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:08:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:08:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:08:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:08:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:08:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:08:58,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:08:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 16:08:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 16:08:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:08:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:08:58,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:08:58,299 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 16:08:59,176 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:08:59,176 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:08:59,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:08:59 BoogieIcfgContainer [2019-12-18 16:08:59,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:08:59,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:08:59,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:08:59,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:08:59,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:08:57" (1/3) ... [2019-12-18 16:08:59,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad8ad60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:08:59, skipping insertion in model container [2019-12-18 16:08:59,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:08:58" (2/3) ... [2019-12-18 16:08:59,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad8ad60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:08:59, skipping insertion in model container [2019-12-18 16:08:59,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:08:59" (3/3) ... [2019-12-18 16:08:59,187 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_rmo.opt.i [2019-12-18 16:08:59,214 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:08:59,214 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:08:59,222 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:08:59,224 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:08:59,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,269 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,276 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,276 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,296 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,296 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,297 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,297 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,297 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,297 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,297 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,298 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,299 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,300 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,301 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,302 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,303 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,304 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,305 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,306 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,307 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,308 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,309 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,310 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,311 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,312 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,313 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,314 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,315 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,316 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,317 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,318 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,319 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,320 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,320 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,320 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,324 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,328 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,337 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,338 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,338 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,339 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,339 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,340 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,340 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,340 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,340 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,340 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,340 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,341 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,342 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,342 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,343 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,344 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,346 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:08:59,361 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 16:08:59,382 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:08:59,382 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:08:59,382 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:08:59,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:08:59,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:08:59,383 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:08:59,383 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:08:59,383 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:08:59,400 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-18 16:08:59,402 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 16:08:59,511 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 16:08:59,511 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:08:59,534 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 16:08:59,568 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 16:08:59,658 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 16:08:59,659 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:08:59,673 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 16:08:59,713 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-18 16:08:59,715 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:09:05,740 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-18 16:09:05,912 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 16:09:06,018 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 16:09:06,442 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 16:09:06,592 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 16:09:06,623 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-18 16:09:06,623 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-18 16:09:06,626 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-18 16:09:15,291 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-18 16:09:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-18 16:09:15,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 16:09:15,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:09:15,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:09:15,300 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:09:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:09:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-18 16:09:15,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:09:15,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286259424] [2019-12-18 16:09:15,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:09:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:09:15,596 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 16:09:15,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286259424] [2019-12-18 16:09:15,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:09:15,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:09:15,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872819697] [2019-12-18 16:09:15,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:09:15,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:09:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:09:15,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:09:15,619 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-18 16:09:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:09:18,270 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-18 16:09:18,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:09:18,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 16:09:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:09:18,899 INFO L225 Difference]: With dead ends: 85406 [2019-12-18 16:09:18,899 INFO L226 Difference]: Without dead ends: 79558 [2019-12-18 16:09:18,901 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 16:09:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-18 16:09:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-18 16:09:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-18 16:09:28,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-18 16:09:28,313 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-18 16:09:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:09:28,314 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-18 16:09:28,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:09:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-18 16:09:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 16:09:28,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:09:28,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:09:28,325 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:09:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:09:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-18 16:09:28,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:09:28,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934883606] [2019-12-18 16:09:28,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:09:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:09:28,467 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 16:09:28,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934883606] [2019-12-18 16:09:28,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:09:28,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:09:28,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580977517] [2019-12-18 16:09:28,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:09:28,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:09:28,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:09:28,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:09:28,471 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-18 16:09:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:09:30,381 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-18 16:09:30,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:09:30,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 16:09:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:09:30,965 INFO L225 Difference]: With dead ends: 126790 [2019-12-18 16:09:30,965 INFO L226 Difference]: Without dead ends: 126726 [2019-12-18 16:09:30,966 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 16:09:33,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-18 16:09:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-18 16:09:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-18 16:09:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-18 16:09:39,980 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-18 16:09:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:09:39,980 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-18 16:09:39,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:09:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-18 16:09:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 16:09:39,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:09:39,993 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 16:09:39,994 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:09:39,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:09:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-18 16:09:39,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:09:39,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500991940] [2019-12-18 16:09:39,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:09:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:09:40,115 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 16:09:40,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500991940] [2019-12-18 16:09:40,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:09:40,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:09:40,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795702180] [2019-12-18 16:09:40,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:09:40,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:09:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:09:40,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:09:40,118 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-18 16:09:47,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:09:47,452 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-18 16:09:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:09:47,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 16:09:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:09:48,042 INFO L225 Difference]: With dead ends: 159910 [2019-12-18 16:09:48,042 INFO L226 Difference]: Without dead ends: 159850 [2019-12-18 16:09:48,043 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 16:09:49,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-18 16:09:52,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-18 16:09:52,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-18 16:09:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-18 16:09:53,499 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-18 16:09:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:09:53,500 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-18 16:09:53,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:09:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-18 16:09:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 16:09:53,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:09:53,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:09:53,520 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:09:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:09:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-18 16:09:53,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:09:53,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531247672] [2019-12-18 16:09:53,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:09:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:09:53,583 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 16:09:53,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531247672] [2019-12-18 16:09:53,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:09:53,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:09:53,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011182843] [2019-12-18 16:09:53,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:09:53,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:09:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:09:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:09:53,585 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-18 16:09:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:09:55,511 INFO L93 Difference]: Finished difference Result 138699 states and 613164 transitions. [2019-12-18 16:09:55,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:09:55,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 16:09:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:09:56,175 INFO L225 Difference]: With dead ends: 138699 [2019-12-18 16:09:56,175 INFO L226 Difference]: Without dead ends: 138699 [2019-12-18 16:09:56,176 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 16:10:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138699 states. [2019-12-18 16:10:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138699 to 138699. [2019-12-18 16:10:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138699 states. [2019-12-18 16:10:06,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138699 states to 138699 states and 613164 transitions. [2019-12-18 16:10:06,798 INFO L78 Accepts]: Start accepts. Automaton has 138699 states and 613164 transitions. Word has length 20 [2019-12-18 16:10:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:06,798 INFO L462 AbstractCegarLoop]: Abstraction has 138699 states and 613164 transitions. [2019-12-18 16:10:06,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 138699 states and 613164 transitions. [2019-12-18 16:10:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 16:10:06,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:06,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:06,816 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:10:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -489613445, now seen corresponding path program 1 times [2019-12-18 16:10:06,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:06,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076032682] [2019-12-18 16:10:06,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:06,890 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 16:10:06,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076032682] [2019-12-18 16:10:06,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:06,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:10:06,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140072658] [2019-12-18 16:10:06,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:10:06,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:06,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:10:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:06,893 INFO L87 Difference]: Start difference. First operand 138699 states and 613164 transitions. Second operand 3 states. [2019-12-18 16:10:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:12,674 INFO L93 Difference]: Finished difference Result 171153 states and 718929 transitions. [2019-12-18 16:10:12,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:10:12,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 16:10:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:13,122 INFO L225 Difference]: With dead ends: 171153 [2019-12-18 16:10:13,122 INFO L226 Difference]: Without dead ends: 139246 [2019-12-18 16:10:13,122 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 16:10:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139246 states. [2019-12-18 16:10:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139246 to 136241. [2019-12-18 16:10:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136241 states. [2019-12-18 16:10:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136241 states to 136241 states and 569267 transitions. [2019-12-18 16:10:18,303 INFO L78 Accepts]: Start accepts. Automaton has 136241 states and 569267 transitions. Word has length 21 [2019-12-18 16:10:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:18,303 INFO L462 AbstractCegarLoop]: Abstraction has 136241 states and 569267 transitions. [2019-12-18 16:10:18,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 136241 states and 569267 transitions. [2019-12-18 16:10:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 16:10:18,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:18,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:18,318 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:10:18,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:18,318 INFO L82 PathProgramCache]: Analyzing trace with hash 338661360, now seen corresponding path program 1 times [2019-12-18 16:10:18,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:18,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560351307] [2019-12-18 16:10:18,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:18,392 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 16:10:18,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560351307] [2019-12-18 16:10:18,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:18,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:10:18,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312103450] [2019-12-18 16:10:18,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:10:18,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:18,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:10:18,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:18,396 INFO L87 Difference]: Start difference. First operand 136241 states and 569267 transitions. Second operand 3 states. [2019-12-18 16:10:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:20,441 INFO L93 Difference]: Finished difference Result 136067 states and 568622 transitions. [2019-12-18 16:10:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:10:20,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 16:10:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:20,859 INFO L225 Difference]: With dead ends: 136067 [2019-12-18 16:10:20,860 INFO L226 Difference]: Without dead ends: 136067 [2019-12-18 16:10:20,860 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 16:10:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136067 states. [2019-12-18 16:10:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136067 to 136067. [2019-12-18 16:10:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136067 states. [2019-12-18 16:10:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136067 states to 136067 states and 568622 transitions. [2019-12-18 16:10:30,045 INFO L78 Accepts]: Start accepts. Automaton has 136067 states and 568622 transitions. Word has length 21 [2019-12-18 16:10:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:30,045 INFO L462 AbstractCegarLoop]: Abstraction has 136067 states and 568622 transitions. [2019-12-18 16:10:30,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 136067 states and 568622 transitions. [2019-12-18 16:10:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:10:30,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:30,062 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 16:10:30,062 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:10:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash -722262292, now seen corresponding path program 1 times [2019-12-18 16:10:30,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:30,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867593153] [2019-12-18 16:10:30,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:30,103 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 16:10:30,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867593153] [2019-12-18 16:10:30,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:30,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:10:30,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024832007] [2019-12-18 16:10:30,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:10:30,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:30,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:10:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:30,106 INFO L87 Difference]: Start difference. First operand 136067 states and 568622 transitions. Second operand 3 states. [2019-12-18 16:10:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:31,701 INFO L93 Difference]: Finished difference Result 132051 states and 552314 transitions. [2019-12-18 16:10:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:10:31,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-18 16:10:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:32,097 INFO L225 Difference]: With dead ends: 132051 [2019-12-18 16:10:32,097 INFO L226 Difference]: Without dead ends: 132051 [2019-12-18 16:10:32,098 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 16:10:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132051 states. [2019-12-18 16:10:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132051 to 131955. [2019-12-18 16:10:40,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131955 states. [2019-12-18 16:10:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131955 states to 131955 states and 552098 transitions. [2019-12-18 16:10:41,123 INFO L78 Accepts]: Start accepts. Automaton has 131955 states and 552098 transitions. Word has length 22 [2019-12-18 16:10:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:41,123 INFO L462 AbstractCegarLoop]: Abstraction has 131955 states and 552098 transitions. [2019-12-18 16:10:41,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 131955 states and 552098 transitions. [2019-12-18 16:10:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:10:41,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:41,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:41,154 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:10:41,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:41,154 INFO L82 PathProgramCache]: Analyzing trace with hash -923267308, now seen corresponding path program 1 times [2019-12-18 16:10:41,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:41,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864903920] [2019-12-18 16:10:41,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:41,221 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 16:10:41,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864903920] [2019-12-18 16:10:41,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:41,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:10:41,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241633104] [2019-12-18 16:10:41,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:10:41,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:41,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:10:41,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:10:41,223 INFO L87 Difference]: Start difference. First operand 131955 states and 552098 transitions. Second operand 5 states. [2019-12-18 16:10:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:43,469 INFO L93 Difference]: Finished difference Result 157697 states and 651127 transitions. [2019-12-18 16:10:43,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:10:43,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 16:10:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:43,913 INFO L225 Difference]: With dead ends: 157697 [2019-12-18 16:10:43,913 INFO L226 Difference]: Without dead ends: 157192 [2019-12-18 16:10:43,913 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 16:10:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157192 states. [2019-12-18 16:10:52,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157192 to 131020. [2019-12-18 16:10:52,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131020 states. [2019-12-18 16:10:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131020 states to 131020 states and 548465 transitions. [2019-12-18 16:10:53,847 INFO L78 Accepts]: Start accepts. Automaton has 131020 states and 548465 transitions. Word has length 24 [2019-12-18 16:10:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:53,847 INFO L462 AbstractCegarLoop]: Abstraction has 131020 states and 548465 transitions. [2019-12-18 16:10:53,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:10:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 131020 states and 548465 transitions. [2019-12-18 16:10:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 16:10:54,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:54,013 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 16:10:54,013 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:10:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1238013314, now seen corresponding path program 1 times [2019-12-18 16:10:54,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:54,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154507577] [2019-12-18 16:10:54,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:54,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 16:10:54,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154507577] [2019-12-18 16:10:54,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:54,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:10:54,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606205402] [2019-12-18 16:10:54,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:10:54,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:10:54,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:54,112 INFO L87 Difference]: Start difference. First operand 131020 states and 548465 transitions. Second operand 3 states. [2019-12-18 16:10:55,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:55,907 INFO L93 Difference]: Finished difference Result 131020 states and 542445 transitions. [2019-12-18 16:10:55,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:10:55,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-18 16:10:55,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:56,298 INFO L225 Difference]: With dead ends: 131020 [2019-12-18 16:10:56,298 INFO L226 Difference]: Without dead ends: 131020 [2019-12-18 16:10:56,298 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 16:10:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131020 states. [2019-12-18 16:11:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131020 to 130668. [2019-12-18 16:11:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130668 states. [2019-12-18 16:11:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130668 states to 130668 states and 541245 transitions. [2019-12-18 16:11:05,527 INFO L78 Accepts]: Start accepts. Automaton has 130668 states and 541245 transitions. Word has length 36 [2019-12-18 16:11:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:05,527 INFO L462 AbstractCegarLoop]: Abstraction has 130668 states and 541245 transitions. [2019-12-18 16:11:05,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:11:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 130668 states and 541245 transitions. [2019-12-18 16:11:05,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 16:11:05,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:05,685 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] [2019-12-18 16:11:05,685 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:05,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:05,686 INFO L82 PathProgramCache]: Analyzing trace with hash -408828653, now seen corresponding path program 1 times [2019-12-18 16:11:05,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:05,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359735081] [2019-12-18 16:11:05,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:05,846 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 16:11:05,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359735081] [2019-12-18 16:11:05,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:05,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:11:05,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918708361] [2019-12-18 16:11:05,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:11:05,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:05,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:11:05,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:11:05,849 INFO L87 Difference]: Start difference. First operand 130668 states and 541245 transitions. Second operand 9 states. [2019-12-18 16:11:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:15,687 INFO L93 Difference]: Finished difference Result 317780 states and 1326818 transitions. [2019-12-18 16:11:15,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 16:11:15,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 16:11:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:16,492 INFO L225 Difference]: With dead ends: 317780 [2019-12-18 16:11:16,493 INFO L226 Difference]: Without dead ends: 265876 [2019-12-18 16:11:16,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:11:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265876 states. [2019-12-18 16:11:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265876 to 193200. [2019-12-18 16:11:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193200 states. [2019-12-18 16:11:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193200 states to 193200 states and 812708 transitions. [2019-12-18 16:11:24,616 INFO L78 Accepts]: Start accepts. Automaton has 193200 states and 812708 transitions. Word has length 37 [2019-12-18 16:11:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:24,616 INFO L462 AbstractCegarLoop]: Abstraction has 193200 states and 812708 transitions. [2019-12-18 16:11:24,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:11:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 193200 states and 812708 transitions. [2019-12-18 16:11:24,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 16:11:24,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:24,897 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] [2019-12-18 16:11:24,897 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:24,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:24,898 INFO L82 PathProgramCache]: Analyzing trace with hash 852679073, now seen corresponding path program 2 times [2019-12-18 16:11:24,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:24,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991967391] [2019-12-18 16:11:24,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:24,980 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 16:11:24,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991967391] [2019-12-18 16:11:24,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:24,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:11:24,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092188907] [2019-12-18 16:11:24,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:11:24,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:24,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:11:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:11:24,982 INFO L87 Difference]: Start difference. First operand 193200 states and 812708 transitions. Second operand 5 states. [2019-12-18 16:11:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:25,354 INFO L93 Difference]: Finished difference Result 72235 states and 256279 transitions. [2019-12-18 16:11:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:11:25,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 16:11:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:25,491 INFO L225 Difference]: With dead ends: 72235 [2019-12-18 16:11:25,491 INFO L226 Difference]: Without dead ends: 60483 [2019-12-18 16:11:25,491 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 16:11:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60483 states. [2019-12-18 16:11:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60483 to 60483. [2019-12-18 16:11:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60483 states. [2019-12-18 16:11:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60483 states to 60483 states and 208420 transitions. [2019-12-18 16:11:28,094 INFO L78 Accepts]: Start accepts. Automaton has 60483 states and 208420 transitions. Word has length 37 [2019-12-18 16:11:28,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:28,094 INFO L462 AbstractCegarLoop]: Abstraction has 60483 states and 208420 transitions. [2019-12-18 16:11:28,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:11:28,094 INFO L276 IsEmpty]: Start isEmpty. Operand 60483 states and 208420 transitions. [2019-12-18 16:11:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 16:11:28,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:28,152 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] [2019-12-18 16:11:28,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:28,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:28,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1191936355, now seen corresponding path program 1 times [2019-12-18 16:11:28,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:28,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388845121] [2019-12-18 16:11:28,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:28,310 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 16:11:28,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388845121] [2019-12-18 16:11:28,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:28,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:11:28,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406475393] [2019-12-18 16:11:28,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:11:28,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:11:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:11:28,312 INFO L87 Difference]: Start difference. First operand 60483 states and 208420 transitions. Second operand 10 states. [2019-12-18 16:11:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:29,664 INFO L93 Difference]: Finished difference Result 102374 states and 355733 transitions. [2019-12-18 16:11:29,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:11:29,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-18 16:11:29,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:30,554 INFO L225 Difference]: With dead ends: 102374 [2019-12-18 16:11:30,554 INFO L226 Difference]: Without dead ends: 97382 [2019-12-18 16:11:30,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:11:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97382 states. [2019-12-18 16:11:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97382 to 62126. [2019-12-18 16:11:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62126 states. [2019-12-18 16:11:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62126 states to 62126 states and 214828 transitions. [2019-12-18 16:11:32,724 INFO L78 Accepts]: Start accepts. Automaton has 62126 states and 214828 transitions. Word has length 38 [2019-12-18 16:11:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:32,724 INFO L462 AbstractCegarLoop]: Abstraction has 62126 states and 214828 transitions. [2019-12-18 16:11:32,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:11:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 62126 states and 214828 transitions. [2019-12-18 16:11:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 16:11:32,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:32,783 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] [2019-12-18 16:11:32,784 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1266404269, now seen corresponding path program 2 times [2019-12-18 16:11:32,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:32,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89378282] [2019-12-18 16:11:32,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:32,886 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 16:11:32,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89378282] [2019-12-18 16:11:32,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:32,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:11:32,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048279357] [2019-12-18 16:11:32,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:11:32,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:32,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:11:32,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:11:32,889 INFO L87 Difference]: Start difference. First operand 62126 states and 214828 transitions. Second operand 7 states. [2019-12-18 16:11:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:34,175 INFO L93 Difference]: Finished difference Result 116359 states and 398873 transitions. [2019-12-18 16:11:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:11:34,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-18 16:11:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:34,415 INFO L225 Difference]: With dead ends: 116359 [2019-12-18 16:11:34,415 INFO L226 Difference]: Without dead ends: 103956 [2019-12-18 16:11:34,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 16:11:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103956 states. [2019-12-18 16:11:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103956 to 67769. [2019-12-18 16:11:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67769 states. [2019-12-18 16:11:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67769 states to 67769 states and 233166 transitions. [2019-12-18 16:11:38,938 INFO L78 Accepts]: Start accepts. Automaton has 67769 states and 233166 transitions. Word has length 38 [2019-12-18 16:11:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:38,939 INFO L462 AbstractCegarLoop]: Abstraction has 67769 states and 233166 transitions. [2019-12-18 16:11:38,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:11:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 67769 states and 233166 transitions. [2019-12-18 16:11:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:11:39,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:39,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:11:39,012 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:39,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:39,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1377430370, now seen corresponding path program 1 times [2019-12-18 16:11:39,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:39,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375259153] [2019-12-18 16:11:39,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:39,101 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 16:11:39,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375259153] [2019-12-18 16:11:39,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:39,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:11:39,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524569474] [2019-12-18 16:11:39,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:11:39,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:39,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:11:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:11:39,104 INFO L87 Difference]: Start difference. First operand 67769 states and 233166 transitions. Second operand 6 states. [2019-12-18 16:11:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:39,700 INFO L93 Difference]: Finished difference Result 18200 states and 59916 transitions. [2019-12-18 16:11:39,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:11:39,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 16:11:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:39,744 INFO L225 Difference]: With dead ends: 18200 [2019-12-18 16:11:39,744 INFO L226 Difference]: Without dead ends: 14583 [2019-12-18 16:11:39,744 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 16:11:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14583 states. [2019-12-18 16:11:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14583 to 13602. [2019-12-18 16:11:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13602 states. [2019-12-18 16:11:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13602 states to 13602 states and 43696 transitions. [2019-12-18 16:11:40,110 INFO L78 Accepts]: Start accepts. Automaton has 13602 states and 43696 transitions. Word has length 39 [2019-12-18 16:11:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:40,110 INFO L462 AbstractCegarLoop]: Abstraction has 13602 states and 43696 transitions. [2019-12-18 16:11:40,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:11:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 13602 states and 43696 transitions. [2019-12-18 16:11:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 16:11:40,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:40,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:11:40,133 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 654156702, now seen corresponding path program 1 times [2019-12-18 16:11:40,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:40,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544497637] [2019-12-18 16:11:40,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:40,219 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 16:11:40,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544497637] [2019-12-18 16:11:40,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:40,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:11:40,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123667231] [2019-12-18 16:11:40,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:11:40,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:11:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:11:40,222 INFO L87 Difference]: Start difference. First operand 13602 states and 43696 transitions. Second operand 4 states. [2019-12-18 16:11:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:40,307 INFO L93 Difference]: Finished difference Result 15351 states and 48207 transitions. [2019-12-18 16:11:40,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:11:40,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-18 16:11:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:40,335 INFO L225 Difference]: With dead ends: 15351 [2019-12-18 16:11:40,335 INFO L226 Difference]: Without dead ends: 13614 [2019-12-18 16:11:40,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 16:11:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13614 states. [2019-12-18 16:11:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13614 to 13597. [2019-12-18 16:11:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13597 states. [2019-12-18 16:11:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13597 states to 13597 states and 43565 transitions. [2019-12-18 16:11:40,624 INFO L78 Accepts]: Start accepts. Automaton has 13597 states and 43565 transitions. Word has length 50 [2019-12-18 16:11:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:40,624 INFO L462 AbstractCegarLoop]: Abstraction has 13597 states and 43565 transitions. [2019-12-18 16:11:40,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:11:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 13597 states and 43565 transitions. [2019-12-18 16:11:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 16:11:40,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:40,649 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] [2019-12-18 16:11:40,649 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -583724662, now seen corresponding path program 2 times [2019-12-18 16:11:40,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:40,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376020922] [2019-12-18 16:11:40,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:40,715 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 16:11:40,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376020922] [2019-12-18 16:11:40,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:40,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:11:40,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23163163] [2019-12-18 16:11:40,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:11:40,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:11:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:11:40,717 INFO L87 Difference]: Start difference. First operand 13597 states and 43565 transitions. Second operand 4 states. [2019-12-18 16:11:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:40,815 INFO L93 Difference]: Finished difference Result 20602 states and 61329 transitions. [2019-12-18 16:11:40,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:11:40,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-18 16:11:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:40,829 INFO L225 Difference]: With dead ends: 20602 [2019-12-18 16:11:40,829 INFO L226 Difference]: Without dead ends: 7379 [2019-12-18 16:11:40,829 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 16:11:40,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-12-18 16:11:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7379. [2019-12-18 16:11:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7379 states. [2019-12-18 16:11:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7379 states to 7379 states and 18683 transitions. [2019-12-18 16:11:40,948 INFO L78 Accepts]: Start accepts. Automaton has 7379 states and 18683 transitions. Word has length 50 [2019-12-18 16:11:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:40,948 INFO L462 AbstractCegarLoop]: Abstraction has 7379 states and 18683 transitions. [2019-12-18 16:11:40,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:11:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7379 states and 18683 transitions. [2019-12-18 16:11:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 16:11:40,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:40,955 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] [2019-12-18 16:11:40,956 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2055850628, now seen corresponding path program 3 times [2019-12-18 16:11:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:40,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461193078] [2019-12-18 16:11:40,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:41,049 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 16:11:41,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461193078] [2019-12-18 16:11:41,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:41,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:11:41,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495877621] [2019-12-18 16:11:41,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:11:41,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:41,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:11:41,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:11:41,051 INFO L87 Difference]: Start difference. First operand 7379 states and 18683 transitions. Second operand 7 states. [2019-12-18 16:11:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:41,158 INFO L93 Difference]: Finished difference Result 6193 states and 15946 transitions. [2019-12-18 16:11:41,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:11:41,159 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 16:11:41,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:41,160 INFO L225 Difference]: With dead ends: 6193 [2019-12-18 16:11:41,160 INFO L226 Difference]: Without dead ends: 484 [2019-12-18 16:11:41,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:11:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-18 16:11:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-18 16:11:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-18 16:11:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1060 transitions. [2019-12-18 16:11:41,167 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1060 transitions. Word has length 50 [2019-12-18 16:11:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:41,168 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1060 transitions. [2019-12-18 16:11:41,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:11:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1060 transitions. [2019-12-18 16:11:41,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:11:41,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:41,169 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, 1, 1, 1] [2019-12-18 16:11:41,169 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-18 16:11:41,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:41,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273466851] [2019-12-18 16:11:41,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:41,263 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 16:11:41,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273466851] [2019-12-18 16:11:41,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:41,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:11:41,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355068204] [2019-12-18 16:11:41,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:11:41,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:41,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:11:41,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:11:41,267 INFO L87 Difference]: Start difference. First operand 484 states and 1060 transitions. Second operand 7 states. [2019-12-18 16:11:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:41,449 INFO L93 Difference]: Finished difference Result 989 states and 2130 transitions. [2019-12-18 16:11:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:11:41,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 16:11:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:41,451 INFO L225 Difference]: With dead ends: 989 [2019-12-18 16:11:41,451 INFO L226 Difference]: Without dead ends: 738 [2019-12-18 16:11:41,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:11:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-18 16:11:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 550. [2019-12-18 16:11:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-18 16:11:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1179 transitions. [2019-12-18 16:11:41,458 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1179 transitions. Word has length 66 [2019-12-18 16:11:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:41,458 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1179 transitions. [2019-12-18 16:11:41,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:11:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1179 transitions. [2019-12-18 16:11:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:11:41,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:41,459 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, 1, 1, 1] [2019-12-18 16:11:41,459 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:41,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:41,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-18 16:11:41,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:41,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408918477] [2019-12-18 16:11:41,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:11:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:11:41,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:11:41,601 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:11:41,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_86| 0 0))) (and (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t141~0.base_40| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t141~0.base_40|) |v_ULTIMATE.start_main_~#t141~0.offset_26| 0))) (= v_~z$r_buff1_thd1~0_165 0) (= v_~main$tmp_guard1~0_48 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t141~0.base_40|) 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~__unbuffered_p1_EAX~0_61) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~__unbuffered_p3_EBX~0_56) (= 0 v_~z$r_buff0_thd3~0_418) (= v_~a~0_28 0) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EAX~0_62) (= v_~z$w_buff0~0_341 0) (= v_~y~0_56 0) (= |v_#valid_84| (store .cse0 |v_ULTIMATE.start_main_~#t141~0.base_40| 1)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t141~0.base_40|) (= 0 v_~__unbuffered_p2_EAX~0_71) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~__unbuffered_p2_EBX~0_75 0) (= v_~z$r_buff1_thd0~0_251 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= 0 v_~weak$$choice0~0_191) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_74 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t141~0.base_40| 4) |v_#length_29|) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_ULTIMATE.start_main_~#t141~0.offset_26|) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t141~0.offset=|v_ULTIMATE.start_main_~#t141~0.offset_26|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_96|, ~a~0=v_~a~0_28, ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_24|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_18|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t141~0.base=|v_ULTIMATE.start_main_~#t141~0.base_40|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_32|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_251, ~y~0=v_~y~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_56, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t141~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ULTIMATE.start_main_~#t144~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t144~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t141~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t142~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~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, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t143~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_~#t143~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t142~0.offset, 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 16:11:41,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t142~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t142~0.base_11| 4)) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t142~0.base_11|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t142~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t142~0.offset_10|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t142~0.base_11|) |v_ULTIMATE.start_main_~#t142~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t142~0.offset=|v_ULTIMATE.start_main_~#t142~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t142~0.base=|v_ULTIMATE.start_main_~#t142~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t142~0.offset, ULTIMATE.start_main_~#t142~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 16:11:41,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t143~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t143~0.base_12| 4)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t143~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t143~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t143~0.base_12|) |v_ULTIMATE.start_main_~#t143~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t143~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t143~0.base=|v_ULTIMATE.start_main_~#t143~0.base_12|, #length=|v_#length_21|, ULTIMATE.start_main_~#t143~0.offset=|v_ULTIMATE.start_main_~#t143~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t143~0.base, #length, ULTIMATE.start_main_~#t143~0.offset] because there is no mapped edge [2019-12-18 16:11:41,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t144~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t144~0.base_13|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t144~0.base_13|) |v_ULTIMATE.start_main_~#t144~0.offset_11| 3)) |v_#memory_int_23|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t144~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t144~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t144~0.base=|v_ULTIMATE.start_main_~#t144~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t144~0.offset=|v_ULTIMATE.start_main_~#t144~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t144~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t144~0.offset, #length] because there is no mapped edge [2019-12-18 16:11:41,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_P3Thread1of1ForFork2_~arg.base_9 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_9) (= 1 v_~z$w_buff0~0_34) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= (mod v_~z$w_buff1_used~0_57 256) 0) (= v_~z$w_buff0_used~0_105 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_11, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_9|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_9, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 16:11:41,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1185947332| |P3Thread1of1ForFork2_#t~ite28_Out-1185947332|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1185947332 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1185947332 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-1185947332| ~z$w_buff0~0_In-1185947332) (not .cse1) (not .cse2)) (and .cse0 (= ~z$w_buff1~0_In-1185947332 |P3Thread1of1ForFork2_#t~ite28_Out-1185947332|) (or .cse1 .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1185947332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1185947332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1185947332, ~z$w_buff1~0=~z$w_buff1~0_In-1185947332} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1185947332|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1185947332|, ~z$w_buff0~0=~z$w_buff0~0_In-1185947332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1185947332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1185947332, ~z$w_buff1~0=~z$w_buff1~0_In-1185947332} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 16:11:41,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_11|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 16:11:41,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-431534655 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-431534655| ~z$mem_tmp~0_In-431534655) (not .cse0)) (and .cse0 (= ~z~0_In-431534655 |P3Thread1of1ForFork2_#t~ite48_Out-431534655|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-431534655, ~z$flush_delayed~0=~z$flush_delayed~0_In-431534655, ~z~0=~z~0_In-431534655} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-431534655, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-431534655|, ~z$flush_delayed~0=~z$flush_delayed~0_In-431534655, ~z~0=~z~0_In-431534655} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-18 16:11:41,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_16 1) (= v_~x~0_21 1) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_10|) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_10)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_16, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 16:11:41,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x~0_18 2) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_31 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~y~0=v_~y~0_31} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_31, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 16:11:41,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-845315281 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-845315281| ~z~0_In-845315281) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-845315281 |P2Thread1of1ForFork1_#t~ite25_Out-845315281|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-845315281, ~z$flush_delayed~0=~z$flush_delayed~0_In-845315281, ~z~0=~z~0_In-845315281} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-845315281, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-845315281|, ~z$flush_delayed~0=~z$flush_delayed~0_In-845315281, ~z~0=~z~0_In-845315281} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 16:11:41,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1069222414 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1069222414 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1069222414 |P3Thread1of1ForFork2_#t~ite51_Out1069222414|)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out1069222414| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1069222414, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1069222414} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out1069222414|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1069222414, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1069222414} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-18 16:11:41,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1805029614 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1805029614 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1805029614 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1805029614 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out1805029614| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite52_Out1805029614| ~z$w_buff1_used~0_In1805029614) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1805029614, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1805029614, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1805029614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805029614} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1805029614|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1805029614, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1805029614, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1805029614, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805029614} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-18 16:11:41,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1083789444 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1083789444 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1083789444) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1083789444 ~z$r_buff0_thd4~0_In1083789444)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1083789444, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1083789444} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1083789444|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1083789444, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1083789444} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 16:11:41,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-707585047 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-707585047 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-707585047 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-707585047 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-707585047 |P3Thread1of1ForFork2_#t~ite54_Out-707585047|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-707585047|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-707585047, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-707585047, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-707585047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-707585047} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-707585047|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-707585047, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-707585047, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-707585047, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-707585047} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-18 16:11:41,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite54_32| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_31|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:11:41,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 v_~z$flush_delayed~0_189) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_46|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_45|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 16:11:41,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~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_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 16:11:41,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite60_Out-25138602| |ULTIMATE.start_main_#t~ite59_Out-25138602|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-25138602 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-25138602 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-25138602 |ULTIMATE.start_main_#t~ite59_Out-25138602|) (not .cse1) .cse2) (and .cse2 (= ~z~0_In-25138602 |ULTIMATE.start_main_#t~ite59_Out-25138602|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-25138602, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-25138602, ~z$w_buff1~0=~z$w_buff1~0_In-25138602, ~z~0=~z~0_In-25138602} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-25138602|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-25138602, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-25138602, ~z$w_buff1~0=~z$w_buff1~0_In-25138602, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-25138602|, ~z~0=~z~0_In-25138602} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 16:11:41,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1126287627 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1126287627 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-1126287627| ~z$w_buff0_used~0_In-1126287627) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1126287627| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1126287627, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1126287627} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1126287627, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1126287627|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1126287627} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 16:11:41,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In-2042209342 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-2042209342 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2042209342 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2042209342 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-2042209342 |ULTIMATE.start_main_#t~ite62_Out-2042209342|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-2042209342|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2042209342, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2042209342, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2042209342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2042209342} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2042209342|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2042209342, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2042209342, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2042209342, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2042209342} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 16:11:41,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In698025101 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In698025101 256)))) (or (and (= ~z$r_buff0_thd0~0_In698025101 |ULTIMATE.start_main_#t~ite63_Out698025101|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out698025101|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In698025101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In698025101} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out698025101|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In698025101, ~z$w_buff0_used~0=~z$w_buff0_used~0_In698025101} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 16:11:41,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In365528977 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In365528977 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In365528977 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In365528977 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out365528977| ~z$r_buff1_thd0~0_In365528977)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite64_Out365528977| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In365528977, ~z$w_buff0_used~0=~z$w_buff0_used~0_In365528977, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In365528977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In365528977} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In365528977, ~z$w_buff0_used~0=~z$w_buff0_used~0_In365528977, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In365528977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In365528977, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out365528977|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 16:11:41,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_27) (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= 1 v_~__unbuffered_p2_EAX~0_41) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~x~0_36 2) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:11:41,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:11:41 BasicIcfg [2019-12-18 16:11:41,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:11:41,801 INFO L168 Benchmark]: Toolchain (without parser) took 164528.11 ms. Allocated memory was 145.2 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 16:11:41,801 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 16:11:41,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 831.35 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 155.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:41,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:41,803 INFO L168 Benchmark]: Boogie Preprocessor took 45.52 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:41,803 INFO L168 Benchmark]: RCFGBuilder took 955.58 ms. Allocated memory is still 203.4 MB. Free memory was 149.6 MB in the beginning and 92.3 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:41,804 INFO L168 Benchmark]: TraceAbstraction took 162619.47 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 91.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 16:11:41,810 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.4 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 831.35 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 155.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 152.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.52 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 149.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 955.58 ms. Allocated memory is still 203.4 MB. Free memory was 149.6 MB in the beginning and 92.3 MB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 162619.47 ms. Allocated memory was 203.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 91.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). 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: 7.2s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 319 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 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) [L781] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_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)) [L782] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 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)) [L783] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 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)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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))=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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 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)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 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) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 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 [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 162.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 47.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4274 SDtfs, 6904 SDslu, 9391 SDs, 0 SdLazy, 3109 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193200occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 95.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 196266 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 75873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...