/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:21:58,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:21:58,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:21:58,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:21:58,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:21:58,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:21:58,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:21:58,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:21:58,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:21:58,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:21:58,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:21:58,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:21:58,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:21:58,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:21:58,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:21:58,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:21:58,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:21:58,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:21:58,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:21:58,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:21:58,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:21:58,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:21:58,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:21:58,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:21:58,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:21:58,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:21:58,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:21:58,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:21:58,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:21:58,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:21:58,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:21:58,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:21:58,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:21:58,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:21:58,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:21:58,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:21:58,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:21:58,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:21:58,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:21:58,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:21:58,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:21:58,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:21:58,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:21:58,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:21:58,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:21:58,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:21:58,311 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:21:58,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:21:58,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:21:58,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:21:58,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:21:58,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:21:58,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:21:58,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:21:58,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:21:58,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:21:58,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:21:58,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:21:58,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:21:58,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:21:58,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:21:58,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:21:58,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:21:58,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:21:58,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:21:58,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:21:58,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:21:58,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:21:58,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:21:58,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:21:58,316 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:21:58,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:21:58,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:21:58,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:21:58,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:21:58,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:21:58,626 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:21:58,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i [2019-12-18 13:21:58,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff076408f/6f84c3546176477883f9c050a247a944/FLAG5e5480a34 [2019-12-18 13:21:59,255 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:21:59,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_pso.opt.i [2019-12-18 13:21:59,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff076408f/6f84c3546176477883f9c050a247a944/FLAG5e5480a34 [2019-12-18 13:21:59,522 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff076408f/6f84c3546176477883f9c050a247a944 [2019-12-18 13:21:59,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:21:59,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:21:59,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:21:59,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:21:59,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:21:59,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:21:59" (1/1) ... [2019-12-18 13:21:59,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:21:59, skipping insertion in model container [2019-12-18 13:21:59,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:21:59" (1/1) ... [2019-12-18 13:21:59,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:21:59,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:22:00,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:22:00,137 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:22:00,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:22:00,333 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:22:00,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00 WrapperNode [2019-12-18 13:22:00,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:22:00,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:22:00,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:22:00,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:22:00,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:22:00,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:22:00,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:22:00,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:22:00,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... [2019-12-18 13:22:00,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:22:00,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:22:00,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:22:00,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:22:00,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:22:00,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:22:00,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:22:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:22:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:22:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:22:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:22:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:22:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:22:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:22:00,498 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:22:00,498 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:22:00,499 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:22:00,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:22:00,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:22:00,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:22:00,504 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 13:22:01,302 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:22:01,302 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:22:01,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:22:01 BoogieIcfgContainer [2019-12-18 13:22:01,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:22:01,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:22:01,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:22:01,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:22:01,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:21:59" (1/3) ... [2019-12-18 13:22:01,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebecb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:22:01, skipping insertion in model container [2019-12-18 13:22:01,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:22:00" (2/3) ... [2019-12-18 13:22:01,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebecb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:22:01, skipping insertion in model container [2019-12-18 13:22:01,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:22:01" (3/3) ... [2019-12-18 13:22:01,324 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_pso.opt.i [2019-12-18 13:22:01,334 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:22:01,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:22:01,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:22:01,343 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:22:01,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,383 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,384 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,388 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,412 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,412 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,412 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,413 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,413 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,413 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,413 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,414 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,415 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,416 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,417 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,418 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,419 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,420 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,439 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,439 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,444 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,445 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,459 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,460 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,460 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,461 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,461 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,461 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,461 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,461 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,462 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:22:01,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:22:01,500 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:22:01,500 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:22:01,500 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:22:01,500 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:22:01,501 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:22:01,501 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:22:01,501 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:22:01,501 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:22:01,523 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 13:22:01,526 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 13:22:01,644 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 13:22:01,645 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:22:01,660 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:22:01,682 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 13:22:01,731 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 13:22:01,732 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:22:01,739 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-18 13:22:01,755 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 13:22:01,756 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:22:06,608 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:22:06,723 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:22:07,234 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 13:22:07,365 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 13:22:07,381 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-18 13:22:07,382 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 13:22:07,385 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-18 13:22:08,592 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-18 13:22:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-18 13:22:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:22:08,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:08,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:08,602 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 13:22:08,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-18 13:22:08,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:08,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127314967] [2019-12-18 13:22:08,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:08,999 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 13:22:09,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127314967] [2019-12-18 13:22:09,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:09,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:22:09,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444711804] [2019-12-18 13:22:09,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:09,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:09,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:09,042 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-18 13:22:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:09,435 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-18 13:22:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:09,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:22:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:09,656 INFO L225 Difference]: With dead ends: 20958 [2019-12-18 13:22:09,656 INFO L226 Difference]: Without dead ends: 19662 [2019-12-18 13:22:09,658 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 13:22:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-18 13:22:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-18 13:22:11,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-18 13:22:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-18 13:22:11,545 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-18 13:22:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:11,547 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-18 13:22:11,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-18 13:22:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:22:11,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:11,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:11,561 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 13:22:11,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:11,561 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-18 13:22:11,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:11,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122573412] [2019-12-18 13:22:11,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:11,709 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 13:22:11,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122573412] [2019-12-18 13:22:11,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:11,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:11,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869207604] [2019-12-18 13:22:11,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:11,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:11,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:11,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:11,714 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-18 13:22:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:12,377 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-18 13:22:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:22:12,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:22:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:12,529 INFO L225 Difference]: With dead ends: 30494 [2019-12-18 13:22:12,530 INFO L226 Difference]: Without dead ends: 30438 [2019-12-18 13:22:12,532 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 13:22:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-18 13:22:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-18 13:22:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-18 13:22:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-18 13:22:14,900 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-18 13:22:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:14,901 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-18 13:22:14,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-18 13:22:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 13:22:14,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:14,907 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 13:22:14,907 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 13:22:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-18 13:22:14,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:14,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358734126] [2019-12-18 13:22:14,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:15,012 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 13:22:15,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358734126] [2019-12-18 13:22:15,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:15,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:15,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955817824] [2019-12-18 13:22:15,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:15,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:15,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:15,015 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-18 13:22:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:15,618 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-18 13:22:15,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:22:15,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 13:22:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:15,741 INFO L225 Difference]: With dead ends: 35230 [2019-12-18 13:22:15,741 INFO L226 Difference]: Without dead ends: 35182 [2019-12-18 13:22:15,741 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 13:22:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-18 13:22:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-18 13:22:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-18 13:22:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-18 13:22:17,106 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-18 13:22:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:17,107 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-18 13:22:17,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-18 13:22:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 13:22:17,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:17,116 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 13:22:17,116 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 13:22:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-18 13:22:17,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:17,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129764447] [2019-12-18 13:22:17,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:17,181 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 13:22:17,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129764447] [2019-12-18 13:22:17,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:17,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:22:17,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481337221] [2019-12-18 13:22:17,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:17,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:17,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:17,184 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-18 13:22:17,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:17,333 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-18 13:22:17,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:17,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 13:22:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:17,404 INFO L225 Difference]: With dead ends: 29747 [2019-12-18 13:22:17,404 INFO L226 Difference]: Without dead ends: 29747 [2019-12-18 13:22:17,405 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 13:22:19,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-18 13:22:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-18 13:22:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-18 13:22:19,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-18 13:22:19,848 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-18 13:22:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:19,849 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-18 13:22:19,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-18 13:22:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:22:19,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:19,865 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 13:22:19,865 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 13:22:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-18 13:22:19,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:19,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061267387] [2019-12-18 13:22:19,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:19,970 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 13:22:19,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061267387] [2019-12-18 13:22:19,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:19,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:19,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993495054] [2019-12-18 13:22:19,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:19,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:19,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:19,972 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-18 13:22:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:20,179 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-18 13:22:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:20,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 13:22:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:20,251 INFO L225 Difference]: With dead ends: 36709 [2019-12-18 13:22:20,251 INFO L226 Difference]: Without dead ends: 30167 [2019-12-18 13:22:20,252 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 13:22:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-18 13:22:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-18 13:22:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-18 13:22:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-18 13:22:21,204 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-18 13:22:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:21,205 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-18 13:22:21,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-18 13:22:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:22:21,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:21,216 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 13:22:21,216 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 13:22:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-18 13:22:21,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:21,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700069781] [2019-12-18 13:22:21,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:21,264 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 13:22:21,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700069781] [2019-12-18 13:22:21,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:21,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:22:21,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601770502] [2019-12-18 13:22:21,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:21,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:21,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:21,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:21,267 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-18 13:22:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:21,405 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-18 13:22:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:21,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 13:22:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:21,469 INFO L225 Difference]: With dead ends: 29289 [2019-12-18 13:22:21,470 INFO L226 Difference]: Without dead ends: 29289 [2019-12-18 13:22:21,470 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 13:22:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-18 13:22:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-18 13:22:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-18 13:22:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-18 13:22:23,403 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-18 13:22:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:23,403 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-18 13:22:23,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-18 13:22:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:22:23,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:23,413 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 13:22:23,413 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 13:22:23,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:23,414 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-18 13:22:23,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:23,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815302709] [2019-12-18 13:22:23,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:23,479 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 13:22:23,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815302709] [2019-12-18 13:22:23,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:23,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:22:23,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949272439] [2019-12-18 13:22:23,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:23,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:23,481 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 3 states. [2019-12-18 13:22:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:23,678 INFO L93 Difference]: Finished difference Result 29205 states and 113300 transitions. [2019-12-18 13:22:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:23,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-18 13:22:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:23,784 INFO L225 Difference]: With dead ends: 29205 [2019-12-18 13:22:23,785 INFO L226 Difference]: Without dead ends: 29205 [2019-12-18 13:22:23,785 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 13:22:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29205 states. [2019-12-18 13:22:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29205 to 28805. [2019-12-18 13:22:24,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28805 states. [2019-12-18 13:22:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28805 states to 28805 states and 111840 transitions. [2019-12-18 13:22:24,737 INFO L78 Accepts]: Start accepts. Automaton has 28805 states and 111840 transitions. Word has length 22 [2019-12-18 13:22:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:24,737 INFO L462 AbstractCegarLoop]: Abstraction has 28805 states and 111840 transitions. [2019-12-18 13:22:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 28805 states and 111840 transitions. [2019-12-18 13:22:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:22:24,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:24,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:24,750 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 13:22:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:24,751 INFO L82 PathProgramCache]: Analyzing trace with hash -9241093, now seen corresponding path program 1 times [2019-12-18 13:22:24,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:24,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568206084] [2019-12-18 13:22:24,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:24,829 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 13:22:24,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568206084] [2019-12-18 13:22:24,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:24,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:22:24,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558354884] [2019-12-18 13:22:24,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:22:24,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:22:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:22:24,832 INFO L87 Difference]: Start difference. First operand 28805 states and 111840 transitions. Second operand 5 states. [2019-12-18 13:22:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:24,935 INFO L93 Difference]: Finished difference Result 12329 states and 39554 transitions. [2019-12-18 13:22:24,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:22:24,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 13:22:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:24,951 INFO L225 Difference]: With dead ends: 12329 [2019-12-18 13:22:24,951 INFO L226 Difference]: Without dead ends: 10557 [2019-12-18 13:22:24,952 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 13:22:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10557 states. [2019-12-18 13:22:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10557 to 10557. [2019-12-18 13:22:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10557 states. [2019-12-18 13:22:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 32994 transitions. [2019-12-18 13:22:25,102 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 32994 transitions. Word has length 23 [2019-12-18 13:22:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:25,103 INFO L462 AbstractCegarLoop]: Abstraction has 10557 states and 32994 transitions. [2019-12-18 13:22:25,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:22:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 32994 transitions. [2019-12-18 13:22:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:22:25,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:25,107 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 13:22:25,107 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 13:22:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1862087193, now seen corresponding path program 1 times [2019-12-18 13:22:25,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:25,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610734686] [2019-12-18 13:22:25,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:25,172 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 13:22:25,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610734686] [2019-12-18 13:22:25,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:25,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:22:25,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159108299] [2019-12-18 13:22:25,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:25,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:25,175 INFO L87 Difference]: Start difference. First operand 10557 states and 32994 transitions. Second operand 4 states. [2019-12-18 13:22:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:25,264 INFO L93 Difference]: Finished difference Result 15941 states and 50535 transitions. [2019-12-18 13:22:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:22:25,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-18 13:22:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:25,282 INFO L225 Difference]: With dead ends: 15941 [2019-12-18 13:22:25,282 INFO L226 Difference]: Without dead ends: 8445 [2019-12-18 13:22:25,282 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 13:22:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2019-12-18 13:22:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 8146. [2019-12-18 13:22:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8146 states. [2019-12-18 13:22:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8146 states to 8146 states and 25593 transitions. [2019-12-18 13:22:25,682 INFO L78 Accepts]: Start accepts. Automaton has 8146 states and 25593 transitions. Word has length 24 [2019-12-18 13:22:25,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:25,683 INFO L462 AbstractCegarLoop]: Abstraction has 8146 states and 25593 transitions. [2019-12-18 13:22:25,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 8146 states and 25593 transitions. [2019-12-18 13:22:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:22:25,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:25,688 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 13:22:25,688 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 13:22:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash -417737333, now seen corresponding path program 2 times [2019-12-18 13:22:25,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:25,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736948738] [2019-12-18 13:22:25,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:25,764 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 13:22:25,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736948738] [2019-12-18 13:22:25,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:25,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:22:25,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816241382] [2019-12-18 13:22:25,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:22:25,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:25,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:22:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:22:25,766 INFO L87 Difference]: Start difference. First operand 8146 states and 25593 transitions. Second operand 6 states. [2019-12-18 13:22:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:25,867 INFO L93 Difference]: Finished difference Result 3111 states and 8924 transitions. [2019-12-18 13:22:25,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:22:25,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:22:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:25,872 INFO L225 Difference]: With dead ends: 3111 [2019-12-18 13:22:25,873 INFO L226 Difference]: Without dead ends: 2590 [2019-12-18 13:22:25,873 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 13:22:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2019-12-18 13:22:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2590. [2019-12-18 13:22:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-12-18 13:22:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 7335 transitions. [2019-12-18 13:22:25,914 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 7335 transitions. Word has length 24 [2019-12-18 13:22:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:25,914 INFO L462 AbstractCegarLoop]: Abstraction has 2590 states and 7335 transitions. [2019-12-18 13:22:25,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:22:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 7335 transitions. [2019-12-18 13:22:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:22:25,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:25,919 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:25,919 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 13:22:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-18 13:22:25,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:25,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945642502] [2019-12-18 13:22:25,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:25,957 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 13:22:25,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945642502] [2019-12-18 13:22:25,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:25,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:22:25,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022154282] [2019-12-18 13:22:25,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:25,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:25,959 INFO L87 Difference]: Start difference. First operand 2590 states and 7335 transitions. Second operand 3 states. [2019-12-18 13:22:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:26,020 INFO L93 Difference]: Finished difference Result 3908 states and 10998 transitions. [2019-12-18 13:22:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:26,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 13:22:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:26,027 INFO L225 Difference]: With dead ends: 3908 [2019-12-18 13:22:26,027 INFO L226 Difference]: Without dead ends: 3908 [2019-12-18 13:22:26,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2019-12-18 13:22:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3066. [2019-12-18 13:22:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3066 states. [2019-12-18 13:22:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 8797 transitions. [2019-12-18 13:22:26,084 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 8797 transitions. Word has length 32 [2019-12-18 13:22:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:26,084 INFO L462 AbstractCegarLoop]: Abstraction has 3066 states and 8797 transitions. [2019-12-18 13:22:26,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 8797 transitions. [2019-12-18 13:22:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 13:22:26,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:26,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:26,090 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 13:22:26,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:26,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-18 13:22:26,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:26,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188987421] [2019-12-18 13:22:26,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:26,185 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 13:22:26,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188987421] [2019-12-18 13:22:26,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:26,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:22:26,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558151041] [2019-12-18 13:22:26,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:22:26,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:22:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:22:26,187 INFO L87 Difference]: Start difference. First operand 3066 states and 8797 transitions. Second operand 7 states. [2019-12-18 13:22:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:26,307 INFO L93 Difference]: Finished difference Result 2322 states and 6997 transitions. [2019-12-18 13:22:26,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:22:26,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-18 13:22:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:26,312 INFO L225 Difference]: With dead ends: 2322 [2019-12-18 13:22:26,312 INFO L226 Difference]: Without dead ends: 1541 [2019-12-18 13:22:26,313 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 13:22:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2019-12-18 13:22:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1541. [2019-12-18 13:22:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2019-12-18 13:22:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 4493 transitions. [2019-12-18 13:22:26,330 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 4493 transitions. Word has length 32 [2019-12-18 13:22:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:26,330 INFO L462 AbstractCegarLoop]: Abstraction has 1541 states and 4493 transitions. [2019-12-18 13:22:26,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:22:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 4493 transitions. [2019-12-18 13:22:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:26,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:26,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:26,333 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 13:22:26,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1763567195, now seen corresponding path program 1 times [2019-12-18 13:22:26,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:26,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711793711] [2019-12-18 13:22:26,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:26,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 13:22:26,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711793711] [2019-12-18 13:22:26,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:26,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:22:26,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544574679] [2019-12-18 13:22:26,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:22:26,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:26,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:22:26,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:26,394 INFO L87 Difference]: Start difference. First operand 1541 states and 4493 transitions. Second operand 3 states. [2019-12-18 13:22:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:26,437 INFO L93 Difference]: Finished difference Result 1841 states and 5137 transitions. [2019-12-18 13:22:26,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:22:26,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-18 13:22:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:26,442 INFO L225 Difference]: With dead ends: 1841 [2019-12-18 13:22:26,443 INFO L226 Difference]: Without dead ends: 1841 [2019-12-18 13:22:26,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:22:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-12-18 13:22:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1504. [2019-12-18 13:22:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2019-12-18 13:22:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 4295 transitions. [2019-12-18 13:22:26,472 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 4295 transitions. Word has length 48 [2019-12-18 13:22:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:26,473 INFO L462 AbstractCegarLoop]: Abstraction has 1504 states and 4295 transitions. [2019-12-18 13:22:26,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:22:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 4295 transitions. [2019-12-18 13:22:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:26,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:26,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:26,477 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 13:22:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash -978641481, now seen corresponding path program 1 times [2019-12-18 13:22:26,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:26,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561686690] [2019-12-18 13:22:26,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:26,562 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 13:22:26,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561686690] [2019-12-18 13:22:26,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:26,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:22:26,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159117918] [2019-12-18 13:22:26,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:22:26,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:22:26,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:22:26,564 INFO L87 Difference]: Start difference. First operand 1504 states and 4295 transitions. Second operand 6 states. [2019-12-18 13:22:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:26,762 INFO L93 Difference]: Finished difference Result 4451 states and 12637 transitions. [2019-12-18 13:22:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:22:26,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-18 13:22:26,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:26,766 INFO L225 Difference]: With dead ends: 4451 [2019-12-18 13:22:26,766 INFO L226 Difference]: Without dead ends: 2913 [2019-12-18 13:22:26,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:22:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-12-18 13:22:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1700. [2019-12-18 13:22:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-12-18 13:22:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 4841 transitions. [2019-12-18 13:22:26,801 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 4841 transitions. Word has length 48 [2019-12-18 13:22:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:26,802 INFO L462 AbstractCegarLoop]: Abstraction has 1700 states and 4841 transitions. [2019-12-18 13:22:26,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:22:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 4841 transitions. [2019-12-18 13:22:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:26,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:26,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:26,806 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 13:22:26,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:26,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 2 times [2019-12-18 13:22:26,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:26,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393849873] [2019-12-18 13:22:26,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:26,868 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 13:22:26,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393849873] [2019-12-18 13:22:26,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:26,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:22:26,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416491067] [2019-12-18 13:22:26,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:22:26,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:22:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:22:26,870 INFO L87 Difference]: Start difference. First operand 1700 states and 4841 transitions. Second operand 4 states. [2019-12-18 13:22:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:26,895 INFO L93 Difference]: Finished difference Result 2126 states and 5787 transitions. [2019-12-18 13:22:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:22:26,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-18 13:22:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:26,896 INFO L225 Difference]: With dead ends: 2126 [2019-12-18 13:22:26,896 INFO L226 Difference]: Without dead ends: 474 [2019-12-18 13:22:26,897 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 13:22:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-12-18 13:22:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2019-12-18 13:22:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-12-18 13:22:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1031 transitions. [2019-12-18 13:22:26,903 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1031 transitions. Word has length 48 [2019-12-18 13:22:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:26,903 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 1031 transitions. [2019-12-18 13:22:26,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:22:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1031 transitions. [2019-12-18 13:22:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:26,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:26,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:26,905 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 13:22:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 3 times [2019-12-18 13:22:26,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:26,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749482133] [2019-12-18 13:22:26,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:22:26,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 13:22:26,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749482133] [2019-12-18 13:22:26,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:22:26,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:22:26,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157434155] [2019-12-18 13:22:26,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:22:26,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:22:26,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:22:26,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:22:26,982 INFO L87 Difference]: Start difference. First operand 474 states and 1031 transitions. Second operand 7 states. [2019-12-18 13:22:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:22:27,140 INFO L93 Difference]: Finished difference Result 842 states and 1801 transitions. [2019-12-18 13:22:27,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:22:27,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 13:22:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:22:27,142 INFO L225 Difference]: With dead ends: 842 [2019-12-18 13:22:27,142 INFO L226 Difference]: Without dead ends: 564 [2019-12-18 13:22:27,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:22:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-18 13:22:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 506. [2019-12-18 13:22:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-12-18 13:22:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1091 transitions. [2019-12-18 13:22:27,149 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1091 transitions. Word has length 48 [2019-12-18 13:22:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:22:27,149 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 1091 transitions. [2019-12-18 13:22:27,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:22:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1091 transitions. [2019-12-18 13:22:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 13:22:27,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:22:27,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:22:27,151 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 13:22:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:22:27,151 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 4 times [2019-12-18 13:22:27,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:22:27,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556519902] [2019-12-18 13:22:27,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:22:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:22:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:22:27,273 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:22:27,273 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:22:27,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t981~0.base_59| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= (select .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59|) 0) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t981~0.base_59|) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59|) |v_ULTIMATE.start_main_~#t981~0.offset_37| 0))) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59| 1)) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= |v_ULTIMATE.start_main_~#t981~0.offset_37| 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t981~0.offset=|v_ULTIMATE.start_main_~#t981~0.offset_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_22|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_32|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~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_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ULTIMATE.start_main_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_56|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~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_132, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~0.offset_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_35|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t981~0.base=|v_ULTIMATE.start_main_~#t981~0.base_59|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t981~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t984~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t983~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t984~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t982~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~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, ULTIMATE.start_main_~#t983~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t981~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:22:27,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t982~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t982~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t982~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t982~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t982~0.base_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11|) |v_ULTIMATE.start_main_~#t982~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t982~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_11|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t982~0.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:22:27,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12|) |v_ULTIMATE.start_main_~#t983~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t983~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t983~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t983~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t983~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t983~0.base] because there is no mapped edge [2019-12-18 13:22:27,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t984~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12|) |v_ULTIMATE.start_main_~#t984~0.offset_10| 3)) |v_#memory_int_15|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12|) 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t984~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t984~0.offset_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t984~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t984~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t984~0.offset, #length] because there is no mapped edge [2019-12-18 13:22:27,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out1144981234 ~__unbuffered_p3_EAX~0_Out1144981234) (= ~z$r_buff1_thd0~0_Out1144981234 ~z$r_buff0_thd0~0_In1144981234) (= ~z$r_buff0_thd2~0_In1144981234 ~z$r_buff1_thd2~0_Out1144981234) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1144981234 0)) (= 1 ~z$r_buff0_thd4~0_Out1144981234) (= ~b~0_In1144981234 ~__unbuffered_p3_EBX~0_Out1144981234) (= ~z$r_buff0_thd1~0_In1144981234 ~z$r_buff1_thd1~0_Out1144981234) (= ~z$r_buff1_thd4~0_Out1144981234 ~z$r_buff0_thd4~0_In1144981234) (= ~a~0_Out1144981234 1) (= ~z$r_buff1_thd3~0_Out1144981234 ~z$r_buff0_thd3~0_In1144981234)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1144981234, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1144981234, ~b~0=~b~0_In1144981234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1144981234, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1144981234, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1144981234, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1144981234} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1144981234, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1144981234, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1144981234, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1144981234, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1144981234, ~a~0=~a~0_Out1144981234, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1144981234, ~b~0=~b~0_In1144981234, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1144981234, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1144981234, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1144981234, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1144981234, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1144981234, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1144981234, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1144981234} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 13:22:27,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_36 1) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~b~0_48 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~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 13:22:27,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= v_P1Thread1of1ForFork0_~arg.base_11 |v_P1Thread1of1ForFork0_#in~arg.base_11|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_11, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_23} 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 13:22:27,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1844334025 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1844334025 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1844334025 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1844334025 256) 0)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1844334025 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite8_Out-1844334025| ~z$w_buff0~0_In-1844334025) (= |P2Thread1of1ForFork1_#t~ite8_Out-1844334025| |P2Thread1of1ForFork1_#t~ite9_Out-1844334025|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite8_In-1844334025| |P2Thread1of1ForFork1_#t~ite8_Out-1844334025|) (= ~z$w_buff0~0_In-1844334025 |P2Thread1of1ForFork1_#t~ite9_Out-1844334025|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1844334025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844334025, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1844334025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1844334025, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1844334025, ~weak$$choice2~0=~weak$$choice2~0_In-1844334025, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1844334025|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1844334025, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1844334025, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1844334025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1844334025, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1844334025, ~weak$$choice2~0=~weak$$choice2~0_In-1844334025, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1844334025|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1844334025|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 13:22:27,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-202105925 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-202105925 256)))) (or (= (mod ~z$w_buff0_used~0_In-202105925 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-202105925 256))) (and .cse0 (= (mod ~z$w_buff1_used~0_In-202105925 256) 0)))) (= |P2Thread1of1ForFork1_#t~ite11_Out-202105925| |P2Thread1of1ForFork1_#t~ite12_Out-202105925|) (= |P2Thread1of1ForFork1_#t~ite11_Out-202105925| ~z$w_buff1~0_In-202105925) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite11_In-202105925| |P2Thread1of1ForFork1_#t~ite11_Out-202105925|) (= |P2Thread1of1ForFork1_#t~ite12_Out-202105925| ~z$w_buff1~0_In-202105925) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-202105925, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-202105925, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-202105925|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-202105925, ~z$w_buff1~0=~z$w_buff1~0_In-202105925, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-202105925, ~weak$$choice2~0=~weak$$choice2~0_In-202105925} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-202105925, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-202105925|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-202105925, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-202105925|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-202105925, ~z$w_buff1~0=~z$w_buff1~0_In-202105925, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-202105925, ~weak$$choice2~0=~weak$$choice2~0_In-202105925} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:22:27,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1121341913 256) 0))) (or (and (= ~z$w_buff0_used~0_In1121341913 |P2Thread1of1ForFork1_#t~ite15_Out1121341913|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1121341913| |P2Thread1of1ForFork1_#t~ite14_Out1121341913|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out1121341913| |P2Thread1of1ForFork1_#t~ite15_Out1121341913|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1121341913 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1121341913 256)) (and (= (mod ~z$w_buff1_used~0_In1121341913 256) 0) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In1121341913 256) 0)))) .cse0 (= |P2Thread1of1ForFork1_#t~ite14_Out1121341913| ~z$w_buff0_used~0_In1121341913)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1121341913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121341913, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1121341913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121341913, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1121341913, ~weak$$choice2~0=~weak$$choice2~0_In1121341913} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1121341913|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1121341913|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121341913, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1121341913, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121341913, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1121341913, ~weak$$choice2~0=~weak$$choice2~0_In1121341913} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 13:22:27,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_11|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 13:22:27,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1468867445 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_In-1468867445| |P2Thread1of1ForFork1_#t~ite23_Out-1468867445|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite24_Out-1468867445| ~z$r_buff1_thd3~0_In-1468867445)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out-1468867445| |P2Thread1of1ForFork1_#t~ite23_Out-1468867445|) (= ~z$r_buff1_thd3~0_In-1468867445 |P2Thread1of1ForFork1_#t~ite23_Out-1468867445|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1468867445 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1468867445 256) 0)) (= (mod ~z$w_buff0_used~0_In-1468867445 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1468867445 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468867445, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1468867445, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-1468867445|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468867445, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1468867445, ~weak$$choice2~0=~weak$$choice2~0_In-1468867445} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-1468867445|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468867445, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1468867445, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-1468867445|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1468867445, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1468867445, ~weak$$choice2~0=~weak$$choice2~0_In-1468867445} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 13:22:27,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:22:27,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2025470196 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2025470196 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-2025470196|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-2025470196| ~z$w_buff0_used~0_In-2025470196)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2025470196, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2025470196} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-2025470196|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2025470196, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2025470196} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 13:22:27,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In196810925 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In196810925 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In196810925 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In196810925 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In196810925 |P3Thread1of1ForFork2_#t~ite29_Out196810925|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out196810925|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In196810925, ~z$w_buff0_used~0=~z$w_buff0_used~0_In196810925, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In196810925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In196810925} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out196810925|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In196810925, ~z$w_buff0_used~0=~z$w_buff0_used~0_In196810925, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In196810925, ~z$w_buff1_used~0=~z$w_buff1_used~0_In196810925} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:22:27,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In361859664 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In361859664 256)))) (or (and (= ~z$r_buff0_thd4~0_Out361859664 ~z$r_buff0_thd4~0_In361859664) (or .cse0 .cse1)) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out361859664 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In361859664, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In361859664} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In361859664, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out361859664, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out361859664|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 13:22:27,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In1068752055 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1068752055 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1068752055 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1068752055 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out1068752055| ~z$r_buff1_thd4~0_In1068752055) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out1068752055|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1068752055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1068752055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1068752055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1068752055} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1068752055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1068752055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1068752055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1068752055, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1068752055|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:22:27,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_62)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 13:22:27,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:22:27,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1960063634| |ULTIMATE.start_main_#t~ite36_Out-1960063634|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1960063634 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1960063634 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In-1960063634 |ULTIMATE.start_main_#t~ite36_Out-1960063634|)) (and (= ~z~0_In-1960063634 |ULTIMATE.start_main_#t~ite36_Out-1960063634|) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960063634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960063634, ~z$w_buff1~0=~z$w_buff1~0_In-1960063634, ~z~0=~z~0_In-1960063634} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1960063634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1960063634, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1960063634|, ~z$w_buff1~0=~z$w_buff1~0_In-1960063634, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1960063634|, ~z~0=~z~0_In-1960063634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:22:27,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In241752113 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In241752113 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In241752113 |ULTIMATE.start_main_#t~ite38_Out241752113|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out241752113| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In241752113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In241752113} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In241752113, ~z$w_buff0_used~0=~z$w_buff0_used~0_In241752113, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out241752113|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 13:22:27,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2107317763 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2107317763 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2107317763 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-2107317763 256) 0))) (or (and (= ~z$w_buff1_used~0_In-2107317763 |ULTIMATE.start_main_#t~ite39_Out-2107317763|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-2107317763|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2107317763, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2107317763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2107317763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2107317763} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2107317763, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2107317763|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2107317763, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2107317763, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2107317763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:22:27,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1440134608 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1440134608 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1440134608| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1440134608 |ULTIMATE.start_main_#t~ite40_Out-1440134608|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1440134608, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1440134608} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1440134608, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1440134608|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1440134608} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 13:22:27,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-420626827 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-420626827 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-420626827 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-420626827 256)))) (or (and (= ~z$r_buff1_thd0~0_In-420626827 |ULTIMATE.start_main_#t~ite41_Out-420626827|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-420626827|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-420626827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-420626827, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-420626827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-420626827} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-420626827|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-420626827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-420626827, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-420626827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-420626827} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 13:22:27,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:22:27,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:22:27 BasicIcfg [2019-12-18 13:22:27,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:22:27,393 INFO L168 Benchmark]: Toolchain (without parser) took 27859.67 ms. Allocated memory was 144.2 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 99.9 MB in the beginning and 530.4 MB in the end (delta: -430.5 MB). Peak memory consumption was 872.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:27,394 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:22:27,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.93 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 155.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:27,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.31 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:27,396 INFO L168 Benchmark]: Boogie Preprocessor took 39.60 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:27,397 INFO L168 Benchmark]: RCFGBuilder took 868.56 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 104.7 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:27,397 INFO L168 Benchmark]: TraceAbstraction took 26086.17 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 104.7 MB in the beginning and 530.4 MB in the end (delta: -425.7 MB). Peak memory consumption was 819.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:22:27,401 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.24 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.93 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 99.7 MB in the beginning and 155.8 MB in the end (delta: -56.1 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.31 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.60 ms. Allocated memory is still 202.4 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 868.56 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 104.7 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26086.17 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 104.7 MB in the beginning and 530.4 MB in the end (delta: -425.7 MB). Peak memory consumption was 819.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t981, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t982, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t983, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t984, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=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] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=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] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=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_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=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] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1748 SDtfs, 2347 SDslu, 2805 SDs, 0 SdLazy, 644 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 11401 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 34870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...