/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:18:00,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:18:00,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:18:00,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:18:00,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:18:00,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:18:00,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:18:00,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:18:00,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:18:00,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:18:00,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:18:00,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:18:00,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:18:00,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:18:00,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:18:00,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:18:00,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:18:00,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:18:00,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:18:00,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:18:00,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:18:00,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:18:00,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:18:00,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:18:00,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:18:00,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:18:00,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:18:00,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:18:00,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:18:00,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:18:00,363 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:18:00,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:18:00,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:18:00,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:18:00,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:18:00,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:18:00,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:18:00,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:18:00,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:18:00,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:18:00,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:18:00,372 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:18:00,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:18:00,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:18:00,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:18:00,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:18:00,410 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:18:00,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:18:00,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:18:00,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:18:00,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:18:00,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:18:00,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:18:00,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:18:00,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:18:00,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:18:00,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:18:00,414 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:18:00,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:18:00,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:18:00,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:18:00,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:18:00,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:18:00,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:18:00,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:18:00,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:18:00,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:18:00,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:18:00,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:18:00,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:18:00,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:18:00,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:18:00,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:18:00,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:18:00,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:18:00,710 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:18:00,711 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-18 17:18:00,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953a1b77e/d5dace2a507f4f3ab47b8a000ec91900/FLAGb40481010 [2019-12-18 17:18:01,408 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:18:01,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-18 17:18:01,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953a1b77e/d5dace2a507f4f3ab47b8a000ec91900/FLAGb40481010 [2019-12-18 17:18:01,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953a1b77e/d5dace2a507f4f3ab47b8a000ec91900 [2019-12-18 17:18:01,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:18:01,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:18:01,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:18:01,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:18:01,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:18:01,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:18:01" (1/1) ... [2019-12-18 17:18:01,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fee1401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:01, skipping insertion in model container [2019-12-18 17:18:01,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:18:01" (1/1) ... [2019-12-18 17:18:01,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:18:01,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:18:02,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:18:02,296 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:18:02,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:18:02,448 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:18:02,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02 WrapperNode [2019-12-18 17:18:02,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:18:02,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:18:02,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:18:02,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:18:02,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:18:02,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:18:02,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:18:02,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:18:02,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (1/1) ... [2019-12-18 17:18:02,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:18:02,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:18:02,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:18:02,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:18:02,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (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 17:18:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:18:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:18:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:18:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:18:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:18:02,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:18:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:18:02,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:18:02,612 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:18:02,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:18:02,614 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:18:02,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:18:02,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:18:02,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:18:02,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:18:02,617 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 17:18:03,331 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:18:03,331 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:18:03,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:18:03 BoogieIcfgContainer [2019-12-18 17:18:03,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:18:03,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:18:03,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:18:03,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:18:03,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:18:01" (1/3) ... [2019-12-18 17:18:03,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1512e123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:18:03, skipping insertion in model container [2019-12-18 17:18:03,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:18:02" (2/3) ... [2019-12-18 17:18:03,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1512e123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:18:03, skipping insertion in model container [2019-12-18 17:18:03,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:18:03" (3/3) ... [2019-12-18 17:18:03,342 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i [2019-12-18 17:18:03,353 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:18:03,354 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:18:03,365 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:18:03,366 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:18:03,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,416 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,416 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,445 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,445 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,445 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,445 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,446 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,446 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,446 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,446 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,447 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,448 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,449 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,449 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,449 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,449 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,449 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,450 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,450 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,450 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,450 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,451 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,451 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,451 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,451 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,452 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,468 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,469 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,473 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,473 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,478 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,479 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,484 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,485 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,485 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,486 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,486 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:18:03,504 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:18:03,520 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:18:03,520 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:18:03,520 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:18:03,520 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:18:03,520 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:18:03,521 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:18:03,521 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:18:03,521 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:18:03,538 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-18 17:18:03,540 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:18:03,627 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:18:03,628 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:18:03,649 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 17:18:03,670 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-18 17:18:03,726 INFO L126 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-18 17:18:03,726 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:18:03,738 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 17:18:03,755 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-18 17:18:03,756 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:18:08,727 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:18:08,866 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:18:09,399 WARN L192 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 17:18:09,548 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 17:18:09,567 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-18 17:18:09,567 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 17:18:09,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-18 17:18:10,826 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-18 17:18:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-18 17:18:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:18:10,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:10,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:10,836 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 17:18:10,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-18 17:18:10,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:10,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760266486] [2019-12-18 17:18:10,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:11,124 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 17:18:11,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760266486] [2019-12-18 17:18:11,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:11,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:18:11,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614390624] [2019-12-18 17:18:11,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:18:11,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:18:11,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:18:11,165 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-18 17:18:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:11,779 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-18 17:18:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:18:11,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:18:11,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:12,030 INFO L225 Difference]: With dead ends: 20958 [2019-12-18 17:18:12,030 INFO L226 Difference]: Without dead ends: 19662 [2019-12-18 17:18:12,031 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 17:18:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-18 17:18:13,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-18 17:18:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-18 17:18:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-18 17:18:13,865 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-18 17:18:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:13,866 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-18 17:18:13,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:18:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-18 17:18:13,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:18:13,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:13,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:13,883 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 17:18:13,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:13,886 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-18 17:18:13,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:13,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112716089] [2019-12-18 17:18:13,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:18:14,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112716089] [2019-12-18 17:18:14,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:14,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:18:14,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705410555] [2019-12-18 17:18:14,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:18:14,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:18:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:18:14,051 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-18 17:18:14,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:14,864 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-18 17:18:14,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:18:14,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:18:14,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:15,028 INFO L225 Difference]: With dead ends: 30494 [2019-12-18 17:18:15,028 INFO L226 Difference]: Without dead ends: 30438 [2019-12-18 17:18:15,029 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 17:18:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-18 17:18:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-18 17:18:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-18 17:18:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-18 17:18:17,228 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-18 17:18:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:17,228 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-18 17:18:17,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:18:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-18 17:18:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 17:18:17,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:17,236 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 17:18:17,236 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 17:18:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:17,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-18 17:18:17,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:17,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886198930] [2019-12-18 17:18:17,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:17,370 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 17:18:17,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886198930] [2019-12-18 17:18:17,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:17,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:18:17,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815621611] [2019-12-18 17:18:17,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:18:17,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:18:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:18:17,376 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-18 17:18:17,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:17,972 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-18 17:18:17,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:18:17,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 17:18:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:18,187 INFO L225 Difference]: With dead ends: 35230 [2019-12-18 17:18:18,187 INFO L226 Difference]: Without dead ends: 35182 [2019-12-18 17:18:18,188 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 17:18:18,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-18 17:18:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-18 17:18:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-18 17:18:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-18 17:18:19,616 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-18 17:18:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:19,617 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-18 17:18:19,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:18:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-18 17:18:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 17:18:19,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:19,629 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 17:18:19,630 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 17:18:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-18 17:18:19,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:19,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510960930] [2019-12-18 17:18:19,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:19,711 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 17:18:19,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510960930] [2019-12-18 17:18:19,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:19,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:18:19,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839861204] [2019-12-18 17:18:19,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:18:19,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:19,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:18:19,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:18:19,713 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-18 17:18:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:19,867 INFO L93 Difference]: Finished difference Result 29747 states and 123892 transitions. [2019-12-18 17:18:19,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:18:19,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 17:18:19,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:19,991 INFO L225 Difference]: With dead ends: 29747 [2019-12-18 17:18:19,991 INFO L226 Difference]: Without dead ends: 29747 [2019-12-18 17:18:19,992 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 17:18:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29747 states. [2019-12-18 17:18:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29747 to 29747. [2019-12-18 17:18:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29747 states. [2019-12-18 17:18:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29747 states to 29747 states and 123892 transitions. [2019-12-18 17:18:22,366 INFO L78 Accepts]: Start accepts. Automaton has 29747 states and 123892 transitions. Word has length 20 [2019-12-18 17:18:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:22,367 INFO L462 AbstractCegarLoop]: Abstraction has 29747 states and 123892 transitions. [2019-12-18 17:18:22,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:18:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 29747 states and 123892 transitions. [2019-12-18 17:18:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:18:22,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:22,378 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 17:18:22,378 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 17:18:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-18 17:18:22,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:22,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571605763] [2019-12-18 17:18:22,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:22,431 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 17:18:22,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571605763] [2019-12-18 17:18:22,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:22,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:18:22,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296028520] [2019-12-18 17:18:22,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:18:22,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:22,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:18:22,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:18:22,433 INFO L87 Difference]: Start difference. First operand 29747 states and 123892 transitions. Second operand 3 states. [2019-12-18 17:18:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:22,864 INFO L93 Difference]: Finished difference Result 36709 states and 144810 transitions. [2019-12-18 17:18:22,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:18:22,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:18:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:22,950 INFO L225 Difference]: With dead ends: 36709 [2019-12-18 17:18:22,950 INFO L226 Difference]: Without dead ends: 30167 [2019-12-18 17:18:22,951 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 17:18:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30167 states. [2019-12-18 17:18:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30167 to 29499. [2019-12-18 17:18:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29499 states. [2019-12-18 17:18:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29499 states to 29499 states and 115623 transitions. [2019-12-18 17:18:24,006 INFO L78 Accepts]: Start accepts. Automaton has 29499 states and 115623 transitions. Word has length 21 [2019-12-18 17:18:24,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:24,006 INFO L462 AbstractCegarLoop]: Abstraction has 29499 states and 115623 transitions. [2019-12-18 17:18:24,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:18:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29499 states and 115623 transitions. [2019-12-18 17:18:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 17:18:24,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:24,016 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 17:18:24,016 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 17:18:24,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:24,016 INFO L82 PathProgramCache]: Analyzing trace with hash 484267595, now seen corresponding path program 1 times [2019-12-18 17:18:24,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:24,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051029688] [2019-12-18 17:18:24,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:24,067 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 17:18:24,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051029688] [2019-12-18 17:18:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:18:24,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677807024] [2019-12-18 17:18:24,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:18:24,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:18:24,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:18:24,069 INFO L87 Difference]: Start difference. First operand 29499 states and 115623 transitions. Second operand 3 states. [2019-12-18 17:18:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:24,221 INFO L93 Difference]: Finished difference Result 29289 states and 114842 transitions. [2019-12-18 17:18:24,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:18:24,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 17:18:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:24,288 INFO L225 Difference]: With dead ends: 29289 [2019-12-18 17:18:24,288 INFO L226 Difference]: Without dead ends: 29289 [2019-12-18 17:18:24,289 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 17:18:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29289 states. [2019-12-18 17:18:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29289 to 29205. [2019-12-18 17:18:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29205 states. [2019-12-18 17:18:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29205 states to 29205 states and 114644 transitions. [2019-12-18 17:18:26,616 INFO L78 Accepts]: Start accepts. Automaton has 29205 states and 114644 transitions. Word has length 21 [2019-12-18 17:18:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:26,616 INFO L462 AbstractCegarLoop]: Abstraction has 29205 states and 114644 transitions. [2019-12-18 17:18:26,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:18:26,616 INFO L276 IsEmpty]: Start isEmpty. Operand 29205 states and 114644 transitions. [2019-12-18 17:18:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:18:26,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:26,626 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 17:18:26,626 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 17:18:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash 291958640, now seen corresponding path program 1 times [2019-12-18 17:18:26,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:26,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422760179] [2019-12-18 17:18:26,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:26,701 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 17:18:26,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422760179] [2019-12-18 17:18:26,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:26,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:18:26,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132945828] [2019-12-18 17:18:26,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:18:26,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:26,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:18:26,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:18:26,703 INFO L87 Difference]: Start difference. First operand 29205 states and 114644 transitions. Second operand 5 states. [2019-12-18 17:18:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:26,833 INFO L93 Difference]: Finished difference Result 12827 states and 41537 transitions. [2019-12-18 17:18:26,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:18:26,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:18:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:26,857 INFO L225 Difference]: With dead ends: 12827 [2019-12-18 17:18:26,857 INFO L226 Difference]: Without dead ends: 10855 [2019-12-18 17:18:26,857 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 17:18:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2019-12-18 17:18:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 10855. [2019-12-18 17:18:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10855 states. [2019-12-18 17:18:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10855 states to 10855 states and 34345 transitions. [2019-12-18 17:18:27,052 INFO L78 Accepts]: Start accepts. Automaton has 10855 states and 34345 transitions. Word has length 22 [2019-12-18 17:18:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:27,052 INFO L462 AbstractCegarLoop]: Abstraction has 10855 states and 34345 transitions. [2019-12-18 17:18:27,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:18:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 10855 states and 34345 transitions. [2019-12-18 17:18:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:18:27,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:27,056 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 17:18:27,056 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 17:18:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:27,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-18 17:18:27,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:27,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064887622] [2019-12-18 17:18:27,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:27,107 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 17:18:27,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064887622] [2019-12-18 17:18:27,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:27,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:18:27,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30377366] [2019-12-18 17:18:27,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:18:27,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:18:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:18:27,109 INFO L87 Difference]: Start difference. First operand 10855 states and 34345 transitions. Second operand 4 states. [2019-12-18 17:18:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:27,185 INFO L93 Difference]: Finished difference Result 16412 states and 52778 transitions. [2019-12-18 17:18:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:18:27,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-18 17:18:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:27,200 INFO L225 Difference]: With dead ends: 16412 [2019-12-18 17:18:27,200 INFO L226 Difference]: Without dead ends: 8743 [2019-12-18 17:18:27,200 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 17:18:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8743 states. [2019-12-18 17:18:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8743 to 8444. [2019-12-18 17:18:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-18 17:18:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 26914 transitions. [2019-12-18 17:18:27,328 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 26914 transitions. Word has length 23 [2019-12-18 17:18:27,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:27,328 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 26914 transitions. [2019-12-18 17:18:27,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:18:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 26914 transitions. [2019-12-18 17:18:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 17:18:27,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:27,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] [2019-12-18 17:18:27,333 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 17:18:27,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:27,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1799428640, now seen corresponding path program 2 times [2019-12-18 17:18:27,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:27,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524137059] [2019-12-18 17:18:27,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:27,427 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 17:18:27,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524137059] [2019-12-18 17:18:27,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:27,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:18:27,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557729826] [2019-12-18 17:18:27,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:18:27,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:27,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:18:27,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:18:27,431 INFO L87 Difference]: Start difference. First operand 8444 states and 26914 transitions. Second operand 6 states. [2019-12-18 17:18:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:27,548 INFO L93 Difference]: Finished difference Result 3436 states and 9854 transitions. [2019-12-18 17:18:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:18:27,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-18 17:18:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:27,556 INFO L225 Difference]: With dead ends: 3436 [2019-12-18 17:18:27,556 INFO L226 Difference]: Without dead ends: 2817 [2019-12-18 17:18:27,557 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 17:18:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-18 17:18:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2797. [2019-12-18 17:18:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-18 17:18:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 7967 transitions. [2019-12-18 17:18:27,789 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 7967 transitions. Word has length 23 [2019-12-18 17:18:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:27,789 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 7967 transitions. [2019-12-18 17:18:27,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:18:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 7967 transitions. [2019-12-18 17:18:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:18:27,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:27,797 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 17:18:27,798 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 17:18:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-18 17:18:27,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:27,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709739269] [2019-12-18 17:18:27,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:27,849 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 17:18:27,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709739269] [2019-12-18 17:18:27,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:27,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:18:27,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332781913] [2019-12-18 17:18:27,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:18:27,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:27,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:18:27,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:18:27,852 INFO L87 Difference]: Start difference. First operand 2797 states and 7967 transitions. Second operand 3 states. [2019-12-18 17:18:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:27,906 INFO L93 Difference]: Finished difference Result 4322 states and 12247 transitions. [2019-12-18 17:18:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:18:27,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 17:18:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:27,914 INFO L225 Difference]: With dead ends: 4322 [2019-12-18 17:18:27,915 INFO L226 Difference]: Without dead ends: 4322 [2019-12-18 17:18:27,915 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 17:18:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4322 states. [2019-12-18 17:18:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4322 to 3273. [2019-12-18 17:18:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-18 17:18:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 9436 transitions. [2019-12-18 17:18:27,982 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 9436 transitions. Word has length 32 [2019-12-18 17:18:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:27,982 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 9436 transitions. [2019-12-18 17:18:27,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:18:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 9436 transitions. [2019-12-18 17:18:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:18:27,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:27,988 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 17:18:27,989 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 17:18:27,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-18 17:18:27,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:27,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955401925] [2019-12-18 17:18:27,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:28,120 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 17:18:28,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955401925] [2019-12-18 17:18:28,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:28,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:18:28,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442543906] [2019-12-18 17:18:28,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:18:28,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:18:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:18:28,122 INFO L87 Difference]: Start difference. First operand 3273 states and 9436 transitions. Second operand 6 states. [2019-12-18 17:18:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:28,661 INFO L93 Difference]: Finished difference Result 6672 states and 18337 transitions. [2019-12-18 17:18:28,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:18:28,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 17:18:28,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:28,673 INFO L225 Difference]: With dead ends: 6672 [2019-12-18 17:18:28,673 INFO L226 Difference]: Without dead ends: 6534 [2019-12-18 17:18:28,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:18:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-12-18 17:18:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 3403. [2019-12-18 17:18:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-12-18 17:18:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 9764 transitions. [2019-12-18 17:18:28,737 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 9764 transitions. Word has length 32 [2019-12-18 17:18:28,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:28,737 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 9764 transitions. [2019-12-18 17:18:28,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:18:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 9764 transitions. [2019-12-18 17:18:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 17:18:28,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:28,741 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 17:18:28,741 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 17:18:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:28,742 INFO L82 PathProgramCache]: Analyzing trace with hash 668169174, now seen corresponding path program 1 times [2019-12-18 17:18:28,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:28,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762893531] [2019-12-18 17:18:28,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:28,825 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 17:18:28,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762893531] [2019-12-18 17:18:28,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:28,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:18:28,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252129656] [2019-12-18 17:18:28,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:18:28,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:18:28,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:18:28,827 INFO L87 Difference]: Start difference. First operand 3403 states and 9764 transitions. Second operand 5 states. [2019-12-18 17:18:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:29,189 INFO L93 Difference]: Finished difference Result 5197 states and 14640 transitions. [2019-12-18 17:18:29,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:18:29,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 17:18:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:29,198 INFO L225 Difference]: With dead ends: 5197 [2019-12-18 17:18:29,198 INFO L226 Difference]: Without dead ends: 5197 [2019-12-18 17:18:29,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:18:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2019-12-18 17:18:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 4563. [2019-12-18 17:18:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4563 states. [2019-12-18 17:18:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 13058 transitions. [2019-12-18 17:18:29,256 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 13058 transitions. Word has length 32 [2019-12-18 17:18:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:29,256 INFO L462 AbstractCegarLoop]: Abstraction has 4563 states and 13058 transitions. [2019-12-18 17:18:29,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:18:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 13058 transitions. [2019-12-18 17:18:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:18:29,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:29,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:29,264 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 17:18:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:29,264 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-18 17:18:29,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:29,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542525436] [2019-12-18 17:18:29,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:29,364 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 17:18:29,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542525436] [2019-12-18 17:18:29,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:29,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:18:29,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105831236] [2019-12-18 17:18:29,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:18:29,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:29,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:18:29,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:18:29,367 INFO L87 Difference]: Start difference. First operand 4563 states and 13058 transitions. Second operand 6 states. [2019-12-18 17:18:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:29,810 INFO L93 Difference]: Finished difference Result 8693 states and 23894 transitions. [2019-12-18 17:18:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:18:29,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 17:18:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:29,826 INFO L225 Difference]: With dead ends: 8693 [2019-12-18 17:18:29,827 INFO L226 Difference]: Without dead ends: 8549 [2019-12-18 17:18:29,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:18:29,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8549 states. [2019-12-18 17:18:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8549 to 4625. [2019-12-18 17:18:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-18 17:18:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 13321 transitions. [2019-12-18 17:18:29,923 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 13321 transitions. Word has length 33 [2019-12-18 17:18:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:29,923 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 13321 transitions. [2019-12-18 17:18:29,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:18:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 13321 transitions. [2019-12-18 17:18:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:18:29,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:29,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:29,930 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 17:18:29,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:29,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1231616427, now seen corresponding path program 1 times [2019-12-18 17:18:29,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:29,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118209309] [2019-12-18 17:18:29,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:30,026 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 17:18:30,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118209309] [2019-12-18 17:18:30,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:30,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:18:30,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223555294] [2019-12-18 17:18:30,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:18:30,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:30,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:18:30,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:18:30,029 INFO L87 Difference]: Start difference. First operand 4625 states and 13321 transitions. Second operand 7 states. [2019-12-18 17:18:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:30,152 INFO L93 Difference]: Finished difference Result 3800 states and 11197 transitions. [2019-12-18 17:18:30,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:18:30,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:18:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:30,159 INFO L225 Difference]: With dead ends: 3800 [2019-12-18 17:18:30,159 INFO L226 Difference]: Without dead ends: 2791 [2019-12-18 17:18:30,159 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 17:18:30,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2019-12-18 17:18:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2401. [2019-12-18 17:18:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2019-12-18 17:18:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 6865 transitions. [2019-12-18 17:18:30,190 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 6865 transitions. Word has length 33 [2019-12-18 17:18:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:30,191 INFO L462 AbstractCegarLoop]: Abstraction has 2401 states and 6865 transitions. [2019-12-18 17:18:30,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:18:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 6865 transitions. [2019-12-18 17:18:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:18:30,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:30,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:30,195 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 17:18:30,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash 537782324, now seen corresponding path program 1 times [2019-12-18 17:18:30,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:30,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159448556] [2019-12-18 17:18:30,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:30,269 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 17:18:30,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159448556] [2019-12-18 17:18:30,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:30,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:18:30,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817492306] [2019-12-18 17:18:30,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:18:30,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:18:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:18:30,271 INFO L87 Difference]: Start difference. First operand 2401 states and 6865 transitions. Second operand 6 states. [2019-12-18 17:18:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:30,543 INFO L93 Difference]: Finished difference Result 6419 states and 18107 transitions. [2019-12-18 17:18:30,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:18:30,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 17:18:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:30,551 INFO L225 Difference]: With dead ends: 6419 [2019-12-18 17:18:30,551 INFO L226 Difference]: Without dead ends: 4118 [2019-12-18 17:18:30,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:18:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2019-12-18 17:18:30,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 2585. [2019-12-18 17:18:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2019-12-18 17:18:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 7335 transitions. [2019-12-18 17:18:30,597 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 7335 transitions. Word has length 47 [2019-12-18 17:18:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:30,598 INFO L462 AbstractCegarLoop]: Abstraction has 2585 states and 7335 transitions. [2019-12-18 17:18:30,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:18:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 7335 transitions. [2019-12-18 17:18:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:18:30,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:30,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:30,602 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 17:18:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:30,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1324143500, now seen corresponding path program 2 times [2019-12-18 17:18:30,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:30,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682470150] [2019-12-18 17:18:30,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:30,668 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 17:18:30,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682470150] [2019-12-18 17:18:30,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:30,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:18:30,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131236555] [2019-12-18 17:18:30,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:18:30,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:30,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:18:30,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:18:30,670 INFO L87 Difference]: Start difference. First operand 2585 states and 7335 transitions. Second operand 4 states. [2019-12-18 17:18:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:30,694 INFO L93 Difference]: Finished difference Result 3315 states and 8929 transitions. [2019-12-18 17:18:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:18:30,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 17:18:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:30,696 INFO L225 Difference]: With dead ends: 3315 [2019-12-18 17:18:30,696 INFO L226 Difference]: Without dead ends: 802 [2019-12-18 17:18:30,697 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 17:18:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-18 17:18:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2019-12-18 17:18:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-12-18 17:18:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1724 transitions. [2019-12-18 17:18:30,707 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1724 transitions. Word has length 47 [2019-12-18 17:18:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:30,708 INFO L462 AbstractCegarLoop]: Abstraction has 802 states and 1724 transitions. [2019-12-18 17:18:30,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:18:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1724 transitions. [2019-12-18 17:18:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:18:30,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:30,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:30,710 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 17:18:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 288167740, now seen corresponding path program 3 times [2019-12-18 17:18:30,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:30,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924325887] [2019-12-18 17:18:30,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:30,799 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 17:18:30,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924325887] [2019-12-18 17:18:30,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:30,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:18:30,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261701882] [2019-12-18 17:18:30,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:18:30,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:30,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:18:30,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:18:30,801 INFO L87 Difference]: Start difference. First operand 802 states and 1724 transitions. Second operand 7 states. [2019-12-18 17:18:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:30,937 INFO L93 Difference]: Finished difference Result 1252 states and 2651 transitions. [2019-12-18 17:18:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:18:30,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 17:18:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:30,938 INFO L225 Difference]: With dead ends: 1252 [2019-12-18 17:18:30,938 INFO L226 Difference]: Without dead ends: 820 [2019-12-18 17:18:30,939 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 17:18:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-18 17:18:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 778. [2019-12-18 17:18:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-12-18 17:18:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1674 transitions. [2019-12-18 17:18:30,950 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1674 transitions. Word has length 47 [2019-12-18 17:18:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:30,952 INFO L462 AbstractCegarLoop]: Abstraction has 778 states and 1674 transitions. [2019-12-18 17:18:30,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:18:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1674 transitions. [2019-12-18 17:18:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:18:30,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:30,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:30,954 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:18:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash -261128468, now seen corresponding path program 4 times [2019-12-18 17:18:30,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:30,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077191524] [2019-12-18 17:18:30,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:31,271 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 17:18:31,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077191524] [2019-12-18 17:18:31,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:31,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:18:31,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285338586] [2019-12-18 17:18:31,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:18:31,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:18:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:18:31,276 INFO L87 Difference]: Start difference. First operand 778 states and 1674 transitions. Second operand 11 states. [2019-12-18 17:18:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:32,775 INFO L93 Difference]: Finished difference Result 1483 states and 2993 transitions. [2019-12-18 17:18:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:18:32,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-12-18 17:18:32,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:32,778 INFO L225 Difference]: With dead ends: 1483 [2019-12-18 17:18:32,778 INFO L226 Difference]: Without dead ends: 1476 [2019-12-18 17:18:32,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-12-18 17:18:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-12-18 17:18:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 592. [2019-12-18 17:18:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-12-18 17:18:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1232 transitions. [2019-12-18 17:18:32,792 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1232 transitions. Word has length 47 [2019-12-18 17:18:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:32,792 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 1232 transitions. [2019-12-18 17:18:32,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:18:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1232 transitions. [2019-12-18 17:18:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:18:32,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:32,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:32,794 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:18:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash -814074946, now seen corresponding path program 5 times [2019-12-18 17:18:32,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:32,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182089558] [2019-12-18 17:18:32,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:32,896 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 17:18:32,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182089558] [2019-12-18 17:18:32,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:32,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:18:32,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473691717] [2019-12-18 17:18:32,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:18:32,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:18:32,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:18:32,898 INFO L87 Difference]: Start difference. First operand 592 states and 1232 transitions. Second operand 7 states. [2019-12-18 17:18:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:33,663 INFO L93 Difference]: Finished difference Result 1104 states and 2248 transitions. [2019-12-18 17:18:33,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:18:33,664 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-18 17:18:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:33,665 INFO L225 Difference]: With dead ends: 1104 [2019-12-18 17:18:33,665 INFO L226 Difference]: Without dead ends: 1104 [2019-12-18 17:18:33,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:18:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-12-18 17:18:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 604. [2019-12-18 17:18:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 17:18:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1266 transitions. [2019-12-18 17:18:33,675 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1266 transitions. Word has length 47 [2019-12-18 17:18:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:33,675 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1266 transitions. [2019-12-18 17:18:33,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:18:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1266 transitions. [2019-12-18 17:18:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 17:18:33,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:33,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:18:33,677 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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 17:18:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2122944686, now seen corresponding path program 6 times [2019-12-18 17:18:33,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:33,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645423140] [2019-12-18 17:18:33,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:18:33,749 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 17:18:33,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645423140] [2019-12-18 17:18:33,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:18:33,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:18:33,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554590412] [2019-12-18 17:18:33,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:18:33,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:18:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:18:33,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:18:33,751 INFO L87 Difference]: Start difference. First operand 604 states and 1266 transitions. Second operand 3 states. [2019-12-18 17:18:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:18:33,763 INFO L93 Difference]: Finished difference Result 604 states and 1264 transitions. [2019-12-18 17:18:33,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:18:33,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-18 17:18:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:18:33,764 INFO L225 Difference]: With dead ends: 604 [2019-12-18 17:18:33,765 INFO L226 Difference]: Without dead ends: 604 [2019-12-18 17:18:33,765 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 17:18:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-18 17:18:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 512. [2019-12-18 17:18:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-18 17:18:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1073 transitions. [2019-12-18 17:18:33,772 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1073 transitions. Word has length 47 [2019-12-18 17:18:33,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:18:33,773 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1073 transitions. [2019-12-18 17:18:33,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:18:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1073 transitions. [2019-12-18 17:18:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 17:18:33,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:18:33,774 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 17:18:33,775 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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 17:18:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:18:33,775 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 1 times [2019-12-18 17:18:33,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:18:33,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810830157] [2019-12-18 17:18:33,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:18:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:18:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:18:33,894 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:18:33,894 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:18:33,898 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) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t989~0.base_59|) |v_ULTIMATE.start_main_~#t989~0.offset_37| 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_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t989~0.base_59| 4)) (= v_~z$mem_tmp~0_16 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59|)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t989~0.base_59|) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t989~0.offset_37|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store .cse0 |v_ULTIMATE.start_main_~#t989~0.base_59| 1) |v_#valid_105|) (= 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_~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) (= 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_~__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_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_23|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~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|, ~__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_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_56|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~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_~#t989~0.base=|v_ULTIMATE.start_main_~#t989~0.base_59|, ~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, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_132, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~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|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_32|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t989~0.offset=|v_ULTIMATE.start_main_~#t989~0.offset_37|, #NULL.base=|v_#NULL.base_5|, 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|, ~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, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~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, ~__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_~#t990~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t989~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, ULTIMATE.start_main_~#t990~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t991~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t992~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t989~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-18 17:18:33,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t990~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t990~0.offset_10| 0) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t990~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11|) |v_ULTIMATE.start_main_~#t990~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t990~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t990~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t990~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 17:18:33,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t991~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t991~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12|) |v_ULTIMATE.start_main_~#t991~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t991~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t991~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t991~0.base, #length] because there is no mapped edge [2019-12-18 17:18:33,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12|) |v_ULTIMATE.start_main_~#t992~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t992~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t992~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t992~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t992~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12|))) 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|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_12|, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t992~0.base, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-18 17:18:33,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff1_thd0~0_Out1399908862 ~z$r_buff0_thd0~0_In1399908862) (= ~z$r_buff0_thd2~0_In1399908862 ~z$r_buff1_thd2~0_Out1399908862) (= ~z$r_buff0_thd4~0_In1399908862 ~z$r_buff1_thd4~0_Out1399908862) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1399908862 0)) (= ~b~0_In1399908862 ~__unbuffered_p3_EBX~0_Out1399908862) (= 1 ~z$r_buff0_thd4~0_Out1399908862) (= 1 ~a~0_Out1399908862) (= ~z$r_buff0_thd1~0_In1399908862 ~z$r_buff1_thd1~0_Out1399908862) (= ~z$r_buff1_thd3~0_Out1399908862 ~z$r_buff0_thd3~0_In1399908862) (= ~__unbuffered_p3_EAX~0_Out1399908862 ~a~0_Out1399908862)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1399908862, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1399908862, ~b~0=~b~0_In1399908862, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1399908862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1399908862, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1399908862, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1399908862} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1399908862, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1399908862, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1399908862, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1399908862, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1399908862, ~a~0=~a~0_Out1399908862, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1399908862, ~b~0=~b~0_In1399908862, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1399908862, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1399908862, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1399908862, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1399908862, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1399908862, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1399908862, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1399908862} 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 17:18:33,903 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 17:18:33,904 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 17:18:33,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In283970347 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_Out283970347| ~z$w_buff0~0_In283970347) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In283970347 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In283970347 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In283970347 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In283970347 256))))) (= |P2Thread1of1ForFork1_#t~ite9_Out283970347| |P2Thread1of1ForFork1_#t~ite8_Out283970347|) .cse1) (and (= |P2Thread1of1ForFork1_#t~ite8_In283970347| |P2Thread1of1ForFork1_#t~ite8_Out283970347|) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite9_Out283970347| ~z$w_buff0~0_In283970347)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In283970347, ~z$w_buff0_used~0=~z$w_buff0_used~0_In283970347, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In283970347, ~z$w_buff1_used~0=~z$w_buff1_used~0_In283970347, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In283970347, ~weak$$choice2~0=~weak$$choice2~0_In283970347, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In283970347|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In283970347, ~z$w_buff0_used~0=~z$w_buff0_used~0_In283970347, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In283970347, ~z$w_buff1_used~0=~z$w_buff1_used~0_In283970347, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In283970347, ~weak$$choice2~0=~weak$$choice2~0_In283970347, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out283970347|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out283970347|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:18:33,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-435951692 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In-435951692| |P2Thread1of1ForFork1_#t~ite11_Out-435951692|) (= |P2Thread1of1ForFork1_#t~ite12_Out-435951692| ~z$w_buff1~0_In-435951692) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite11_Out-435951692| ~z$w_buff1~0_In-435951692) (= |P2Thread1of1ForFork1_#t~ite11_Out-435951692| |P2Thread1of1ForFork1_#t~ite12_Out-435951692|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-435951692 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-435951692 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-435951692 256))) (= (mod ~z$w_buff0_used~0_In-435951692 256) 0))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-435951692, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-435951692, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-435951692|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-435951692, ~z$w_buff1~0=~z$w_buff1~0_In-435951692, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-435951692, ~weak$$choice2~0=~weak$$choice2~0_In-435951692} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-435951692, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-435951692|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-435951692, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-435951692|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-435951692, ~z$w_buff1~0=~z$w_buff1~0_In-435951692, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-435951692, ~weak$$choice2~0=~weak$$choice2~0_In-435951692} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:18:33,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1454354208 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out1454354208| |P2Thread1of1ForFork1_#t~ite14_Out1454354208|) (= |P2Thread1of1ForFork1_#t~ite14_Out1454354208| ~z$w_buff0_used~0_In1454354208) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1454354208 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1454354208 256)) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1454354208 256))) (= 0 (mod ~z$w_buff0_used~0_In1454354208 256))))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite15_Out1454354208| ~z$w_buff0_used~0_In1454354208) (= |P2Thread1of1ForFork1_#t~ite14_In1454354208| |P2Thread1of1ForFork1_#t~ite14_Out1454354208|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1454354208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1454354208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1454354208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1454354208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1454354208, ~weak$$choice2~0=~weak$$choice2~0_In1454354208} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1454354208|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1454354208|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1454354208, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1454354208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1454354208, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1454354208, ~weak$$choice2~0=~weak$$choice2~0_In1454354208} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-18 17:18:33,913 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 17:18:33,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1312599707 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite24_Out1312599707| |P2Thread1of1ForFork1_#t~ite23_Out1312599707|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1312599707 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1312599707 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In1312599707 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1312599707 256)))) (= ~z$r_buff1_thd3~0_In1312599707 |P2Thread1of1ForFork1_#t~ite23_Out1312599707|)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out1312599707| ~z$r_buff1_thd3~0_In1312599707) (= |P2Thread1of1ForFork1_#t~ite23_In1312599707| |P2Thread1of1ForFork1_#t~ite23_Out1312599707|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1312599707, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1312599707, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In1312599707|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1312599707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1312599707, ~weak$$choice2~0=~weak$$choice2~0_In1312599707} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out1312599707|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1312599707, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1312599707, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out1312599707|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1312599707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1312599707, ~weak$$choice2~0=~weak$$choice2~0_In1312599707} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-18 17:18:33,914 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 17:18:33,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1341414240 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1341414240 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-1341414240| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1341414240| ~z$w_buff0_used~0_In-1341414240)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341414240, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1341414240} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1341414240|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1341414240, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1341414240} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 17:18:33,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1188703030 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1188703030 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1188703030 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1188703030 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1188703030|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1188703030 |P3Thread1of1ForFork2_#t~ite29_Out1188703030|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1188703030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1188703030, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1188703030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1188703030} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1188703030|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1188703030, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1188703030, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1188703030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1188703030} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 17:18:33,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1166650797 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1166650797 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-1166650797 0)) (and (= ~z$r_buff0_thd4~0_Out-1166650797 ~z$r_buff0_thd4~0_In-1166650797) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166650797, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1166650797} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166650797, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1166650797, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-1166650797|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-18 17:18:33,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1197508771 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1197508771 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1197508771 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1197508771 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1197508771|)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out-1197508771| ~z$r_buff1_thd4~0_In-1197508771) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1197508771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197508771, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1197508771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197508771} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1197508771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1197508771, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1197508771, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1197508771, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1197508771|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 17:18:33,918 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 17:18:33,919 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 17:18:33,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1721587525 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1721587525 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-1721587525| |ULTIMATE.start_main_#t~ite36_Out-1721587525|))) (or (and (= ~z$w_buff1~0_In-1721587525 |ULTIMATE.start_main_#t~ite36_Out-1721587525|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-1721587525 |ULTIMATE.start_main_#t~ite36_Out-1721587525|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1721587525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1721587525, ~z$w_buff1~0=~z$w_buff1~0_In-1721587525, ~z~0=~z~0_In-1721587525} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1721587525, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1721587525, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1721587525|, ~z$w_buff1~0=~z$w_buff1~0_In-1721587525, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1721587525|, ~z~0=~z~0_In-1721587525} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 17:18:33,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1853092286 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1853092286 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1853092286| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1853092286 |ULTIMATE.start_main_#t~ite38_Out1853092286|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1853092286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1853092286} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1853092286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1853092286, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1853092286|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 17:18:33,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1165085217 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1165085217 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1165085217 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1165085217 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1165085217 |ULTIMATE.start_main_#t~ite39_Out-1165085217|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1165085217|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1165085217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165085217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165085217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165085217} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1165085217, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1165085217|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1165085217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1165085217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1165085217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 17:18:33,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1985664529 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1985664529 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1985664529| ~z$r_buff0_thd0~0_In1985664529)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out1985664529|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1985664529, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1985664529} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1985664529, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1985664529|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1985664529} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 17:18:33,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1231582905 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1231582905 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1231582905 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1231582905 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1231582905| ~z$r_buff1_thd0~0_In1231582905) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite41_Out1231582905| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1231582905, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1231582905, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1231582905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1231582905} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1231582905|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1231582905, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1231582905, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1231582905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1231582905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:18:33,923 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 17:18:34,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:18:34 BasicIcfg [2019-12-18 17:18:34,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:18:34,005 INFO L168 Benchmark]: Toolchain (without parser) took 32302.24 ms. Allocated memory was 144.7 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 99.5 MB in the beginning and 634.6 MB in the end (delta: -535.1 MB). Peak memory consumption was 873.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:18:34,005 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 17:18:34,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.43 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.5 MB in the beginning and 155.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:18:34,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.39 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:18:34,007 INFO L168 Benchmark]: Boogie Preprocessor took 39.35 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:18:34,008 INFO L168 Benchmark]: RCFGBuilder took 780.20 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 103.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:18:34,008 INFO L168 Benchmark]: TraceAbstraction took 30669.02 ms. Allocated memory was 201.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 103.8 MB in the beginning and 634.6 MB in the end (delta: -530.8 MB). Peak memory consumption was 820.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:18:34,011 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.47 ms. Allocated memory is still 144.7 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 745.43 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.5 MB in the beginning and 155.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.39 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.35 ms. Allocated memory is still 201.9 MB. Free memory was 152.3 MB in the beginning and 150.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 780.20 ms. Allocated memory is still 201.9 MB. Free memory was 150.4 MB in the beginning and 103.8 MB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30669.02 ms. Allocated memory was 201.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 103.8 MB in the beginning and 634.6 MB in the end (delta: -530.8 MB). Peak memory consumption was 820.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 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.3s, 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(&t989, ((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(&t990, ((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(&t991, ((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(&t992, ((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: 30.3s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2480 SDtfs, 3233 SDslu, 4909 SDs, 0 SdLazy, 2819 SolverSat, 256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.7s 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 20750 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 664 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 73010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...