/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:13:43,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:13:43,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:13:43,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:13:43,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:13:43,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:13:43,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:13:43,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:13:43,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:13:43,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:13:43,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:13:43,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:13:43,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:13:43,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:13:43,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:13:43,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:13:43,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:13:43,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:13:43,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:13:43,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:13:43,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:13:43,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:13:43,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:13:43,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:13:43,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:13:43,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:13:43,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:13:43,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:13:43,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:13:43,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:13:43,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:13:43,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:13:43,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:13:43,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:13:43,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:13:43,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:13:43,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:13:43,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:13:43,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:13:43,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:13:43,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:13:43,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:13:43,425 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:13:43,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:13:43,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:13:43,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:13:43,429 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:13:43,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:13:43,430 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:13:43,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:13:43,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:13:43,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:13:43,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:13:43,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:13:43,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:13:43,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:13:43,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:13:43,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:13:43,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:13:43,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:13:43,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:13:43,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:13:43,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:13:43,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:43,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:13:43,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:13:43,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:13:43,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:13:43,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:13:43,435 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:13:43,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:13:43,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:13:43,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:13:43,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:13:43,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:13:43,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:13:43,727 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:13:43,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2019-12-27 06:13:43,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180e375bf/664242bd57e2442a9432b973f6ed9211/FLAG6f8241d65 [2019-12-27 06:13:44,396 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:13:44,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2019-12-27 06:13:44,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180e375bf/664242bd57e2442a9432b973f6ed9211/FLAG6f8241d65 [2019-12-27 06:13:44,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/180e375bf/664242bd57e2442a9432b973f6ed9211 [2019-12-27 06:13:44,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:13:44,654 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:13:44,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:44,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:13:44,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:13:44,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:44" (1/1) ... [2019-12-27 06:13:44,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579e47a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:44, skipping insertion in model container [2019-12-27 06:13:44,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:44" (1/1) ... [2019-12-27 06:13:44,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:13:44,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:13:45,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:45,293 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:13:45,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:45,450 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:13:45,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45 WrapperNode [2019-12-27 06:13:45,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:45,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:45,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:13:45,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:13:45,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:45,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:13:45,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:13:45,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:13:45,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (1/1) ... [2019-12-27 06:13:45,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:13:45,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:13:45,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:13:45,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:13:45,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (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-27 06:13:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:13:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:13:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:13:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:13:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:13:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:13:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:13:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:13:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:13:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:13:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:13:45,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:13:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:13:45,626 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:13:46,440 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:13:46,440 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:13:46,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:46 BoogieIcfgContainer [2019-12-27 06:13:46,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:13:46,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:13:46,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:13:46,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:13:46,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:44" (1/3) ... [2019-12-27 06:13:46,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421227d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:46, skipping insertion in model container [2019-12-27 06:13:46,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:45" (2/3) ... [2019-12-27 06:13:46,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421227d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:46, skipping insertion in model container [2019-12-27 06:13:46,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:46" (3/3) ... [2019-12-27 06:13:46,451 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_pso.oepc.i [2019-12-27 06:13:46,462 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:13:46,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:13:46,471 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:13:46,472 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:13:46,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,531 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,539 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,572 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,572 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,579 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,579 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,581 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,600 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:46,621 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:13:46,643 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:13:46,643 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:13:46,643 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:13:46,643 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:13:46,643 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:13:46,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:13:46,644 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:13:46,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:13:46,665 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 06:13:46,666 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 06:13:46,800 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 06:13:46,801 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:46,822 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:13:46,843 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 06:13:46,901 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 06:13:46,902 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:46,909 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:13:46,936 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:13:46,937 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:13:50,592 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:13:50,735 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:13:50,761 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86141 [2019-12-27 06:13:50,761 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 06:13:50,765 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 107 transitions [2019-12-27 06:14:14,392 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 132752 states. [2019-12-27 06:14:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 132752 states. [2019-12-27 06:14:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:14:14,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:14,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:14:14,402 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash 920980, now seen corresponding path program 1 times [2019-12-27 06:14:14,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:14,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502103034] [2019-12-27 06:14:14,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:14,626 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-27 06:14:14,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502103034] [2019-12-27 06:14:14,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:14,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:14:14,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385382866] [2019-12-27 06:14:14,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:14,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:14,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:14,658 INFO L87 Difference]: Start difference. First operand 132752 states. Second operand 3 states. [2019-12-27 06:14:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:15,995 INFO L93 Difference]: Finished difference Result 131526 states and 562532 transitions. [2019-12-27 06:14:15,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:15,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:14:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:16,644 INFO L225 Difference]: With dead ends: 131526 [2019-12-27 06:14:16,645 INFO L226 Difference]: Without dead ends: 123882 [2019-12-27 06:14:16,646 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-27 06:14:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123882 states. [2019-12-27 06:14:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123882 to 123882. [2019-12-27 06:14:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123882 states. [2019-12-27 06:14:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123882 states to 123882 states and 529184 transitions. [2019-12-27 06:14:34,117 INFO L78 Accepts]: Start accepts. Automaton has 123882 states and 529184 transitions. Word has length 3 [2019-12-27 06:14:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:34,118 INFO L462 AbstractCegarLoop]: Abstraction has 123882 states and 529184 transitions. [2019-12-27 06:14:34,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:14:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 123882 states and 529184 transitions. [2019-12-27 06:14:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:14:34,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:34,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:34,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash 710493958, now seen corresponding path program 1 times [2019-12-27 06:14:34,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:34,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838476095] [2019-12-27 06:14:34,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:34,256 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-27 06:14:34,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838476095] [2019-12-27 06:14:34,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:34,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:14:34,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915573253] [2019-12-27 06:14:34,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:14:34,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:34,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:14:34,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:14:34,260 INFO L87 Difference]: Start difference. First operand 123882 states and 529184 transitions. Second operand 4 states. [2019-12-27 06:14:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:35,746 INFO L93 Difference]: Finished difference Result 192368 states and 789500 transitions. [2019-12-27 06:14:35,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:14:35,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:14:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:36,404 INFO L225 Difference]: With dead ends: 192368 [2019-12-27 06:14:36,405 INFO L226 Difference]: Without dead ends: 192319 [2019-12-27 06:14:36,405 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-27 06:14:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192319 states. [2019-12-27 06:14:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192319 to 176439. [2019-12-27 06:14:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176439 states. [2019-12-27 06:14:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176439 states to 176439 states and 733020 transitions. [2019-12-27 06:14:59,310 INFO L78 Accepts]: Start accepts. Automaton has 176439 states and 733020 transitions. Word has length 11 [2019-12-27 06:14:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:59,310 INFO L462 AbstractCegarLoop]: Abstraction has 176439 states and 733020 transitions. [2019-12-27 06:14:59,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:14:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 176439 states and 733020 transitions. [2019-12-27 06:14:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:14:59,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:59,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:59,320 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:14:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 379802942, now seen corresponding path program 1 times [2019-12-27 06:14:59,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:59,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365591603] [2019-12-27 06:14:59,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:59,407 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-27 06:14:59,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365591603] [2019-12-27 06:14:59,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:59,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:14:59,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742376028] [2019-12-27 06:14:59,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:59,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:59,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:59,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:59,409 INFO L87 Difference]: Start difference. First operand 176439 states and 733020 transitions. Second operand 3 states. [2019-12-27 06:14:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:59,549 INFO L93 Difference]: Finished difference Result 37131 states and 120949 transitions. [2019-12-27 06:14:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:59,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:14:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:59,665 INFO L225 Difference]: With dead ends: 37131 [2019-12-27 06:14:59,666 INFO L226 Difference]: Without dead ends: 37131 [2019-12-27 06:14:59,666 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-27 06:15:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37131 states. [2019-12-27 06:15:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37131 to 37131. [2019-12-27 06:15:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37131 states. [2019-12-27 06:15:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37131 states to 37131 states and 120949 transitions. [2019-12-27 06:15:00,446 INFO L78 Accepts]: Start accepts. Automaton has 37131 states and 120949 transitions. Word has length 13 [2019-12-27 06:15:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 37131 states and 120949 transitions. [2019-12-27 06:15:00,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 37131 states and 120949 transitions. [2019-12-27 06:15:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:15:00,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:00,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:00,451 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash 63930122, now seen corresponding path program 1 times [2019-12-27 06:15:00,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:00,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219477758] [2019-12-27 06:15:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:00,559 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-27 06:15:00,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219477758] [2019-12-27 06:15:00,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:00,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:00,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454028812] [2019-12-27 06:15:00,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:00,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:00,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:00,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:00,561 INFO L87 Difference]: Start difference. First operand 37131 states and 120949 transitions. Second operand 5 states. [2019-12-27 06:15:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:01,149 INFO L93 Difference]: Finished difference Result 51130 states and 164640 transitions. [2019-12-27 06:15:01,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:01,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:15:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:01,257 INFO L225 Difference]: With dead ends: 51130 [2019-12-27 06:15:01,257 INFO L226 Difference]: Without dead ends: 51130 [2019-12-27 06:15:01,258 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-27 06:15:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51130 states. [2019-12-27 06:15:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51130 to 43859. [2019-12-27 06:15:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43859 states. [2019-12-27 06:15:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43859 states to 43859 states and 142404 transitions. [2019-12-27 06:15:03,524 INFO L78 Accepts]: Start accepts. Automaton has 43859 states and 142404 transitions. Word has length 16 [2019-12-27 06:15:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:03,525 INFO L462 AbstractCegarLoop]: Abstraction has 43859 states and 142404 transitions. [2019-12-27 06:15:03,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 43859 states and 142404 transitions. [2019-12-27 06:15:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:15:03,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:03,537 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-27 06:15:03,537 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:03,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:03,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1543064485, now seen corresponding path program 1 times [2019-12-27 06:15:03,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:03,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202223394] [2019-12-27 06:15:03,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:03,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-27 06:15:03,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202223394] [2019-12-27 06:15:03,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:03,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:03,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837381820] [2019-12-27 06:15:03,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:03,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:03,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:03,671 INFO L87 Difference]: Start difference. First operand 43859 states and 142404 transitions. Second operand 6 states. [2019-12-27 06:15:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:04,640 INFO L93 Difference]: Finished difference Result 65194 states and 206492 transitions. [2019-12-27 06:15:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:04,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:15:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:04,742 INFO L225 Difference]: With dead ends: 65194 [2019-12-27 06:15:04,743 INFO L226 Difference]: Without dead ends: 65187 [2019-12-27 06:15:04,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:05,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65187 states. [2019-12-27 06:15:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65187 to 43757. [2019-12-27 06:15:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43757 states. [2019-12-27 06:15:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43757 states to 43757 states and 141300 transitions. [2019-12-27 06:15:06,553 INFO L78 Accepts]: Start accepts. Automaton has 43757 states and 141300 transitions. Word has length 22 [2019-12-27 06:15:06,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:06,554 INFO L462 AbstractCegarLoop]: Abstraction has 43757 states and 141300 transitions. [2019-12-27 06:15:06,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 43757 states and 141300 transitions. [2019-12-27 06:15:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:15:06,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:06,571 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] [2019-12-27 06:15:06,571 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:06,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:06,572 INFO L82 PathProgramCache]: Analyzing trace with hash 970281241, now seen corresponding path program 1 times [2019-12-27 06:15:06,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:06,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435922932] [2019-12-27 06:15:06,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:06,645 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-27 06:15:06,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435922932] [2019-12-27 06:15:06,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:06,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:06,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553150880] [2019-12-27 06:15:06,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:06,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:06,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:06,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:06,647 INFO L87 Difference]: Start difference. First operand 43757 states and 141300 transitions. Second operand 4 states. [2019-12-27 06:15:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:06,731 INFO L93 Difference]: Finished difference Result 17328 states and 52920 transitions. [2019-12-27 06:15:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:15:06,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:15:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:06,758 INFO L225 Difference]: With dead ends: 17328 [2019-12-27 06:15:06,758 INFO L226 Difference]: Without dead ends: 17328 [2019-12-27 06:15:06,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17328 states. [2019-12-27 06:15:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17328 to 17035. [2019-12-27 06:15:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17035 states. [2019-12-27 06:15:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17035 states to 17035 states and 52084 transitions. [2019-12-27 06:15:07,098 INFO L78 Accepts]: Start accepts. Automaton has 17035 states and 52084 transitions. Word has length 25 [2019-12-27 06:15:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:07,098 INFO L462 AbstractCegarLoop]: Abstraction has 17035 states and 52084 transitions. [2019-12-27 06:15:07,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 17035 states and 52084 transitions. [2019-12-27 06:15:07,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:15:07,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:07,115 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] [2019-12-27 06:15:07,115 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:07,115 INFO L82 PathProgramCache]: Analyzing trace with hash 847537641, now seen corresponding path program 1 times [2019-12-27 06:15:07,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:07,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889577758] [2019-12-27 06:15:07,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:07,195 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-27 06:15:07,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889577758] [2019-12-27 06:15:07,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:07,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:07,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077366625] [2019-12-27 06:15:07,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:07,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:07,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:07,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:07,197 INFO L87 Difference]: Start difference. First operand 17035 states and 52084 transitions. Second operand 3 states. [2019-12-27 06:15:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:07,299 INFO L93 Difference]: Finished difference Result 24679 states and 73906 transitions. [2019-12-27 06:15:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:07,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:15:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:07,333 INFO L225 Difference]: With dead ends: 24679 [2019-12-27 06:15:07,333 INFO L226 Difference]: Without dead ends: 24679 [2019-12-27 06:15:07,333 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-27 06:15:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24679 states. [2019-12-27 06:15:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24679 to 18893. [2019-12-27 06:15:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18893 states. [2019-12-27 06:15:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18893 states to 18893 states and 57180 transitions. [2019-12-27 06:15:07,681 INFO L78 Accepts]: Start accepts. Automaton has 18893 states and 57180 transitions. Word has length 27 [2019-12-27 06:15:07,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:07,682 INFO L462 AbstractCegarLoop]: Abstraction has 18893 states and 57180 transitions. [2019-12-27 06:15:07,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18893 states and 57180 transitions. [2019-12-27 06:15:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:15:07,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:07,695 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] [2019-12-27 06:15:07,695 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:07,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1249538234, now seen corresponding path program 1 times [2019-12-27 06:15:07,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:07,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664701554] [2019-12-27 06:15:07,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:07,789 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-27 06:15:07,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664701554] [2019-12-27 06:15:07,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:07,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:07,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569536907] [2019-12-27 06:15:07,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:07,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:07,792 INFO L87 Difference]: Start difference. First operand 18893 states and 57180 transitions. Second operand 6 states. [2019-12-27 06:15:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:08,461 INFO L93 Difference]: Finished difference Result 26342 states and 77765 transitions. [2019-12-27 06:15:08,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:15:08,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 06:15:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:08,498 INFO L225 Difference]: With dead ends: 26342 [2019-12-27 06:15:08,498 INFO L226 Difference]: Without dead ends: 26342 [2019-12-27 06:15:08,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:15:08,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2019-12-27 06:15:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 21635. [2019-12-27 06:15:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21635 states. [2019-12-27 06:15:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21635 states to 21635 states and 65084 transitions. [2019-12-27 06:15:09,394 INFO L78 Accepts]: Start accepts. Automaton has 21635 states and 65084 transitions. Word has length 27 [2019-12-27 06:15:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:09,395 INFO L462 AbstractCegarLoop]: Abstraction has 21635 states and 65084 transitions. [2019-12-27 06:15:09,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 21635 states and 65084 transitions. [2019-12-27 06:15:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:15:09,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:09,418 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-27 06:15:09,418 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash 303260619, now seen corresponding path program 1 times [2019-12-27 06:15:09,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:09,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820924408] [2019-12-27 06:15:09,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:09,541 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-27 06:15:09,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820924408] [2019-12-27 06:15:09,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:09,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:15:09,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235081184] [2019-12-27 06:15:09,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:09,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:09,544 INFO L87 Difference]: Start difference. First operand 21635 states and 65084 transitions. Second operand 7 states. [2019-12-27 06:15:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:10,864 INFO L93 Difference]: Finished difference Result 29098 states and 85533 transitions. [2019-12-27 06:15:10,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:15:10,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:15:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:10,905 INFO L225 Difference]: With dead ends: 29098 [2019-12-27 06:15:10,905 INFO L226 Difference]: Without dead ends: 29098 [2019-12-27 06:15:10,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:15:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29098 states. [2019-12-27 06:15:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29098 to 19796. [2019-12-27 06:15:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19796 states. [2019-12-27 06:15:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19796 states to 19796 states and 59787 transitions. [2019-12-27 06:15:11,281 INFO L78 Accepts]: Start accepts. Automaton has 19796 states and 59787 transitions. Word has length 33 [2019-12-27 06:15:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:11,281 INFO L462 AbstractCegarLoop]: Abstraction has 19796 states and 59787 transitions. [2019-12-27 06:15:11,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 19796 states and 59787 transitions. [2019-12-27 06:15:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:15:11,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:11,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:11,306 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:11,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:11,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1014539128, now seen corresponding path program 1 times [2019-12-27 06:15:11,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:11,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379809894] [2019-12-27 06:15:11,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:11,398 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-27 06:15:11,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379809894] [2019-12-27 06:15:11,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:11,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:15:11,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177688919] [2019-12-27 06:15:11,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:11,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:11,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:11,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:11,401 INFO L87 Difference]: Start difference. First operand 19796 states and 59787 transitions. Second operand 3 states. [2019-12-27 06:15:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:11,493 INFO L93 Difference]: Finished difference Result 19795 states and 59785 transitions. [2019-12-27 06:15:11,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:11,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:15:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:11,535 INFO L225 Difference]: With dead ends: 19795 [2019-12-27 06:15:11,536 INFO L226 Difference]: Without dead ends: 19795 [2019-12-27 06:15:11,536 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-27 06:15:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19795 states. [2019-12-27 06:15:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19795 to 19795. [2019-12-27 06:15:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19795 states. [2019-12-27 06:15:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19795 states to 19795 states and 59785 transitions. [2019-12-27 06:15:12,003 INFO L78 Accepts]: Start accepts. Automaton has 19795 states and 59785 transitions. Word has length 39 [2019-12-27 06:15:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:12,004 INFO L462 AbstractCegarLoop]: Abstraction has 19795 states and 59785 transitions. [2019-12-27 06:15:12,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19795 states and 59785 transitions. [2019-12-27 06:15:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:15:12,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:12,027 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] [2019-12-27 06:15:12,027 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash 756070649, now seen corresponding path program 1 times [2019-12-27 06:15:12,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:12,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934179099] [2019-12-27 06:15:12,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:12,092 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-27 06:15:12,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934179099] [2019-12-27 06:15:12,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:12,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:12,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425409833] [2019-12-27 06:15:12,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:12,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:12,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:12,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:12,095 INFO L87 Difference]: Start difference. First operand 19795 states and 59785 transitions. Second operand 5 states. [2019-12-27 06:15:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:12,692 INFO L93 Difference]: Finished difference Result 18449 states and 56713 transitions. [2019-12-27 06:15:12,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:12,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 06:15:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:12,722 INFO L225 Difference]: With dead ends: 18449 [2019-12-27 06:15:12,722 INFO L226 Difference]: Without dead ends: 18449 [2019-12-27 06:15:12,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18449 states. [2019-12-27 06:15:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18449 to 17868. [2019-12-27 06:15:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17868 states. [2019-12-27 06:15:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17868 states to 17868 states and 55144 transitions. [2019-12-27 06:15:13,009 INFO L78 Accepts]: Start accepts. Automaton has 17868 states and 55144 transitions. Word has length 40 [2019-12-27 06:15:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:13,009 INFO L462 AbstractCegarLoop]: Abstraction has 17868 states and 55144 transitions. [2019-12-27 06:15:13,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 17868 states and 55144 transitions. [2019-12-27 06:15:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:13,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:13,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:13,030 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 465623346, now seen corresponding path program 1 times [2019-12-27 06:15:13,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:13,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618078759] [2019-12-27 06:15:13,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:13,085 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-27 06:15:13,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618078759] [2019-12-27 06:15:13,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:13,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:13,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889039150] [2019-12-27 06:15:13,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:13,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:13,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:13,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:13,087 INFO L87 Difference]: Start difference. First operand 17868 states and 55144 transitions. Second operand 3 states. [2019-12-27 06:15:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:13,218 INFO L93 Difference]: Finished difference Result 23807 states and 72041 transitions. [2019-12-27 06:15:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:13,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:15:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:13,255 INFO L225 Difference]: With dead ends: 23807 [2019-12-27 06:15:13,255 INFO L226 Difference]: Without dead ends: 23807 [2019-12-27 06:15:13,255 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-27 06:15:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23807 states. [2019-12-27 06:15:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23807 to 17426. [2019-12-27 06:15:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17426 states. [2019-12-27 06:15:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17426 states to 17426 states and 53191 transitions. [2019-12-27 06:15:13,594 INFO L78 Accepts]: Start accepts. Automaton has 17426 states and 53191 transitions. Word has length 64 [2019-12-27 06:15:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:13,594 INFO L462 AbstractCegarLoop]: Abstraction has 17426 states and 53191 transitions. [2019-12-27 06:15:13,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:13,595 INFO L276 IsEmpty]: Start isEmpty. Operand 17426 states and 53191 transitions. [2019-12-27 06:15:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:13,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:13,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:13,620 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -693487797, now seen corresponding path program 1 times [2019-12-27 06:15:13,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:13,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349908396] [2019-12-27 06:15:13,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:13,710 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-27 06:15:13,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349908396] [2019-12-27 06:15:13,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:13,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:13,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292113995] [2019-12-27 06:15:13,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:13,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:13,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:13,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:13,712 INFO L87 Difference]: Start difference. First operand 17426 states and 53191 transitions. Second operand 7 states. [2019-12-27 06:15:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:14,176 INFO L93 Difference]: Finished difference Result 48084 states and 145917 transitions. [2019-12-27 06:15:14,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:14,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:15:14,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:14,227 INFO L225 Difference]: With dead ends: 48084 [2019-12-27 06:15:14,228 INFO L226 Difference]: Without dead ends: 37467 [2019-12-27 06:15:14,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:15:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37467 states. [2019-12-27 06:15:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37467 to 20749. [2019-12-27 06:15:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20749 states. [2019-12-27 06:15:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20749 states to 20749 states and 63592 transitions. [2019-12-27 06:15:14,706 INFO L78 Accepts]: Start accepts. Automaton has 20749 states and 63592 transitions. Word has length 64 [2019-12-27 06:15:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:14,707 INFO L462 AbstractCegarLoop]: Abstraction has 20749 states and 63592 transitions. [2019-12-27 06:15:14,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 20749 states and 63592 transitions. [2019-12-27 06:15:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:14,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:14,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:14,734 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1789693793, now seen corresponding path program 2 times [2019-12-27 06:15:14,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:14,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204700912] [2019-12-27 06:15:14,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:14,827 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-27 06:15:14,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204700912] [2019-12-27 06:15:14,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:14,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:14,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435063545] [2019-12-27 06:15:14,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:14,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:14,830 INFO L87 Difference]: Start difference. First operand 20749 states and 63592 transitions. Second operand 7 states. [2019-12-27 06:15:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:15,878 INFO L93 Difference]: Finished difference Result 56386 states and 169231 transitions. [2019-12-27 06:15:15,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:15,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:15:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:15,932 INFO L225 Difference]: With dead ends: 56386 [2019-12-27 06:15:15,932 INFO L226 Difference]: Without dead ends: 41272 [2019-12-27 06:15:15,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:15:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41272 states. [2019-12-27 06:15:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41272 to 24336. [2019-12-27 06:15:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24336 states. [2019-12-27 06:15:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24336 states to 24336 states and 74402 transitions. [2019-12-27 06:15:16,474 INFO L78 Accepts]: Start accepts. Automaton has 24336 states and 74402 transitions. Word has length 64 [2019-12-27 06:15:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:16,475 INFO L462 AbstractCegarLoop]: Abstraction has 24336 states and 74402 transitions. [2019-12-27 06:15:16,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 24336 states and 74402 transitions. [2019-12-27 06:15:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:16,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:16,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:16,503 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash 679233867, now seen corresponding path program 3 times [2019-12-27 06:15:16,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:16,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256562588] [2019-12-27 06:15:16,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:16,634 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-27 06:15:16,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256562588] [2019-12-27 06:15:16,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:16,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:16,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615878073] [2019-12-27 06:15:16,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:16,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:16,636 INFO L87 Difference]: Start difference. First operand 24336 states and 74402 transitions. Second operand 9 states. [2019-12-27 06:15:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:18,062 INFO L93 Difference]: Finished difference Result 73251 states and 220222 transitions. [2019-12-27 06:15:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 06:15:18,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:15:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:18,175 INFO L225 Difference]: With dead ends: 73251 [2019-12-27 06:15:18,175 INFO L226 Difference]: Without dead ends: 70628 [2019-12-27 06:15:18,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:15:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70628 states. [2019-12-27 06:15:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70628 to 24492. [2019-12-27 06:15:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24492 states. [2019-12-27 06:15:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24492 states to 24492 states and 75064 transitions. [2019-12-27 06:15:19,598 INFO L78 Accepts]: Start accepts. Automaton has 24492 states and 75064 transitions. Word has length 64 [2019-12-27 06:15:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:19,598 INFO L462 AbstractCegarLoop]: Abstraction has 24492 states and 75064 transitions. [2019-12-27 06:15:19,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 24492 states and 75064 transitions. [2019-12-27 06:15:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:19,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 06:15:19,626 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 539911759, now seen corresponding path program 4 times [2019-12-27 06:15:19,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:19,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992372729] [2019-12-27 06:15:19,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:19,742 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-27 06:15:19,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992372729] [2019-12-27 06:15:19,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:19,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:19,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817229598] [2019-12-27 06:15:19,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:19,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:19,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:19,746 INFO L87 Difference]: Start difference. First operand 24492 states and 75064 transitions. Second operand 9 states. [2019-12-27 06:15:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:21,143 INFO L93 Difference]: Finished difference Result 82759 states and 249081 transitions. [2019-12-27 06:15:21,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:15:21,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 06:15:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:21,252 INFO L225 Difference]: With dead ends: 82759 [2019-12-27 06:15:21,252 INFO L226 Difference]: Without dead ends: 80200 [2019-12-27 06:15:21,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:15:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80200 states. [2019-12-27 06:15:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80200 to 24529. [2019-12-27 06:15:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24529 states. [2019-12-27 06:15:22,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24529 states to 24529 states and 75262 transitions. [2019-12-27 06:15:22,805 INFO L78 Accepts]: Start accepts. Automaton has 24529 states and 75262 transitions. Word has length 64 [2019-12-27 06:15:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:22,806 INFO L462 AbstractCegarLoop]: Abstraction has 24529 states and 75262 transitions. [2019-12-27 06:15:22,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 24529 states and 75262 transitions. [2019-12-27 06:15:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:22,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:22,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:22,831 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:22,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash -101721945, now seen corresponding path program 5 times [2019-12-27 06:15:22,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:22,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111929727] [2019-12-27 06:15:22,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:22,892 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-27 06:15:22,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111929727] [2019-12-27 06:15:22,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:22,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:22,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367176439] [2019-12-27 06:15:22,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:22,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:22,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:22,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:22,895 INFO L87 Difference]: Start difference. First operand 24529 states and 75262 transitions. Second operand 3 states. [2019-12-27 06:15:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:23,055 INFO L93 Difference]: Finished difference Result 28844 states and 88337 transitions. [2019-12-27 06:15:23,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:23,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:15:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:23,097 INFO L225 Difference]: With dead ends: 28844 [2019-12-27 06:15:23,097 INFO L226 Difference]: Without dead ends: 28844 [2019-12-27 06:15:23,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 06:15:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28844 states. [2019-12-27 06:15:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28844 to 25486. [2019-12-27 06:15:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25486 states. [2019-12-27 06:15:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25486 states to 25486 states and 78425 transitions. [2019-12-27 06:15:23,519 INFO L78 Accepts]: Start accepts. Automaton has 25486 states and 78425 transitions. Word has length 64 [2019-12-27 06:15:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:23,519 INFO L462 AbstractCegarLoop]: Abstraction has 25486 states and 78425 transitions. [2019-12-27 06:15:23,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 25486 states and 78425 transitions. [2019-12-27 06:15:23,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:23,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:23,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:23,547 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash -255354465, now seen corresponding path program 1 times [2019-12-27 06:15:23,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:23,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343147338] [2019-12-27 06:15:23,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:23,591 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-27 06:15:23,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343147338] [2019-12-27 06:15:23,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:23,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:23,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161370710] [2019-12-27 06:15:23,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:23,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:23,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:23,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:23,598 INFO L87 Difference]: Start difference. First operand 25486 states and 78425 transitions. Second operand 3 states. [2019-12-27 06:15:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:23,836 INFO L93 Difference]: Finished difference Result 35862 states and 111079 transitions. [2019-12-27 06:15:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:23,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:15:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:23,891 INFO L225 Difference]: With dead ends: 35862 [2019-12-27 06:15:23,891 INFO L226 Difference]: Without dead ends: 35862 [2019-12-27 06:15:23,891 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-27 06:15:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35862 states. [2019-12-27 06:15:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35862 to 26322. [2019-12-27 06:15:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26322 states. [2019-12-27 06:15:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26322 states to 26322 states and 81010 transitions. [2019-12-27 06:15:24,382 INFO L78 Accepts]: Start accepts. Automaton has 26322 states and 81010 transitions. Word has length 65 [2019-12-27 06:15:24,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:24,382 INFO L462 AbstractCegarLoop]: Abstraction has 26322 states and 81010 transitions. [2019-12-27 06:15:24,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:24,382 INFO L276 IsEmpty]: Start isEmpty. Operand 26322 states and 81010 transitions. [2019-12-27 06:15:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:24,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:24,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:24,410 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1966497405, now seen corresponding path program 2 times [2019-12-27 06:15:24,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:24,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128571497] [2019-12-27 06:15:24,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:24,511 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-27 06:15:24,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128571497] [2019-12-27 06:15:24,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:24,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:15:24,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660122262] [2019-12-27 06:15:24,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:15:24,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:24,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:15:24,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:24,514 INFO L87 Difference]: Start difference. First operand 26322 states and 81010 transitions. Second operand 8 states. [2019-12-27 06:15:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:26,265 INFO L93 Difference]: Finished difference Result 66649 states and 201649 transitions. [2019-12-27 06:15:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:15:26,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:15:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:26,363 INFO L225 Difference]: With dead ends: 66649 [2019-12-27 06:15:26,364 INFO L226 Difference]: Without dead ends: 63016 [2019-12-27 06:15:26,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:15:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63016 states. [2019-12-27 06:15:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63016 to 26412. [2019-12-27 06:15:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26412 states. [2019-12-27 06:15:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26412 states to 26412 states and 81379 transitions. [2019-12-27 06:15:27,071 INFO L78 Accepts]: Start accepts. Automaton has 26412 states and 81379 transitions. Word has length 65 [2019-12-27 06:15:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:27,071 INFO L462 AbstractCegarLoop]: Abstraction has 26412 states and 81379 transitions. [2019-12-27 06:15:27,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:15:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 26412 states and 81379 transitions. [2019-12-27 06:15:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:27,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:27,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:27,102 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash 765140549, now seen corresponding path program 3 times [2019-12-27 06:15:27,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:27,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326294359] [2019-12-27 06:15:27,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:27,224 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-27 06:15:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326294359] [2019-12-27 06:15:27,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:27,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:27,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834380098] [2019-12-27 06:15:27,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:27,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:27,226 INFO L87 Difference]: Start difference. First operand 26412 states and 81379 transitions. Second operand 9 states. [2019-12-27 06:15:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:28,440 INFO L93 Difference]: Finished difference Result 74722 states and 224033 transitions. [2019-12-27 06:15:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 06:15:28,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:15:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:28,539 INFO L225 Difference]: With dead ends: 74722 [2019-12-27 06:15:28,539 INFO L226 Difference]: Without dead ends: 71089 [2019-12-27 06:15:28,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:15:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71089 states. [2019-12-27 06:15:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71089 to 26420. [2019-12-27 06:15:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26420 states. [2019-12-27 06:15:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26420 states to 26420 states and 81394 transitions. [2019-12-27 06:15:30,004 INFO L78 Accepts]: Start accepts. Automaton has 26420 states and 81394 transitions. Word has length 65 [2019-12-27 06:15:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:30,004 INFO L462 AbstractCegarLoop]: Abstraction has 26420 states and 81394 transitions. [2019-12-27 06:15:30,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 26420 states and 81394 transitions. [2019-12-27 06:15:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:30,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:30,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:30,035 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2002809857, now seen corresponding path program 4 times [2019-12-27 06:15:30,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:30,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790975394] [2019-12-27 06:15:30,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:30,158 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-27 06:15:30,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790975394] [2019-12-27 06:15:30,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:30,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:30,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157180420] [2019-12-27 06:15:30,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:15:30,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:15:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:30,160 INFO L87 Difference]: Start difference. First operand 26420 states and 81394 transitions. Second operand 9 states. [2019-12-27 06:15:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:31,929 INFO L93 Difference]: Finished difference Result 81638 states and 244427 transitions. [2019-12-27 06:15:31,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 06:15:31,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:15:31,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:32,080 INFO L225 Difference]: With dead ends: 81638 [2019-12-27 06:15:32,081 INFO L226 Difference]: Without dead ends: 78036 [2019-12-27 06:15:32,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:15:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78036 states. [2019-12-27 06:15:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78036 to 26315. [2019-12-27 06:15:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26315 states. [2019-12-27 06:15:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26315 states to 26315 states and 80875 transitions. [2019-12-27 06:15:33,521 INFO L78 Accepts]: Start accepts. Automaton has 26315 states and 80875 transitions. Word has length 65 [2019-12-27 06:15:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:33,521 INFO L462 AbstractCegarLoop]: Abstraction has 26315 states and 80875 transitions. [2019-12-27 06:15:33,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:15:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 26315 states and 80875 transitions. [2019-12-27 06:15:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:33,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:33,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:33,553 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:33,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:33,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1618555097, now seen corresponding path program 5 times [2019-12-27 06:15:33,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:33,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210186799] [2019-12-27 06:15:33,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:33,724 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-27 06:15:33,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210186799] [2019-12-27 06:15:33,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:33,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:33,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449266564] [2019-12-27 06:15:33,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:15:33,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:15:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:33,730 INFO L87 Difference]: Start difference. First operand 26315 states and 80875 transitions. Second operand 8 states. [2019-12-27 06:15:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:34,463 INFO L93 Difference]: Finished difference Result 42815 states and 131817 transitions. [2019-12-27 06:15:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:15:34,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:15:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:34,526 INFO L225 Difference]: With dead ends: 42815 [2019-12-27 06:15:34,527 INFO L226 Difference]: Without dead ends: 42815 [2019-12-27 06:15:34,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42815 states. [2019-12-27 06:15:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42815 to 29193. [2019-12-27 06:15:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29193 states. [2019-12-27 06:15:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29193 states to 29193 states and 90198 transitions. [2019-12-27 06:15:35,114 INFO L78 Accepts]: Start accepts. Automaton has 29193 states and 90198 transitions. Word has length 65 [2019-12-27 06:15:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:35,114 INFO L462 AbstractCegarLoop]: Abstraction has 29193 states and 90198 transitions. [2019-12-27 06:15:35,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:15:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 29193 states and 90198 transitions. [2019-12-27 06:15:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:35,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:35,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:35,149 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:35,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1430272868, now seen corresponding path program 1 times [2019-12-27 06:15:35,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:35,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475628152] [2019-12-27 06:15:35,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:35,208 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-27 06:15:35,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475628152] [2019-12-27 06:15:35,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:35,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:35,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152090972] [2019-12-27 06:15:35,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:35,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:35,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:35,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:35,210 INFO L87 Difference]: Start difference. First operand 29193 states and 90198 transitions. Second operand 3 states. [2019-12-27 06:15:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:35,318 INFO L93 Difference]: Finished difference Result 24401 states and 74117 transitions. [2019-12-27 06:15:35,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:35,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:15:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:35,350 INFO L225 Difference]: With dead ends: 24401 [2019-12-27 06:15:35,350 INFO L226 Difference]: Without dead ends: 24401 [2019-12-27 06:15:35,351 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-27 06:15:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24401 states. [2019-12-27 06:15:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24401 to 23087. [2019-12-27 06:15:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23087 states. [2019-12-27 06:15:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23087 states to 23087 states and 69985 transitions. [2019-12-27 06:15:36,282 INFO L78 Accepts]: Start accepts. Automaton has 23087 states and 69985 transitions. Word has length 65 [2019-12-27 06:15:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:36,283 INFO L462 AbstractCegarLoop]: Abstraction has 23087 states and 69985 transitions. [2019-12-27 06:15:36,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23087 states and 69985 transitions. [2019-12-27 06:15:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:36,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:36,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:36,309 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1219517666, now seen corresponding path program 1 times [2019-12-27 06:15:36,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:36,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798332848] [2019-12-27 06:15:36,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:36,487 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-27 06:15:36,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798332848] [2019-12-27 06:15:36,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:36,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:15:36,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324919703] [2019-12-27 06:15:36,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:15:36,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:36,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:15:36,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:15:36,489 INFO L87 Difference]: Start difference. First operand 23087 states and 69985 transitions. Second operand 10 states. [2019-12-27 06:15:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:38,367 INFO L93 Difference]: Finished difference Result 48222 states and 147637 transitions. [2019-12-27 06:15:38,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:15:38,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 06:15:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:38,433 INFO L225 Difference]: With dead ends: 48222 [2019-12-27 06:15:38,433 INFO L226 Difference]: Without dead ends: 48222 [2019-12-27 06:15:38,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2019-12-27 06:15:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48222 states. [2019-12-27 06:15:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48222 to 24122. [2019-12-27 06:15:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24122 states. [2019-12-27 06:15:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24122 states to 24122 states and 73565 transitions. [2019-12-27 06:15:38,986 INFO L78 Accepts]: Start accepts. Automaton has 24122 states and 73565 transitions. Word has length 66 [2019-12-27 06:15:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:38,986 INFO L462 AbstractCegarLoop]: Abstraction has 24122 states and 73565 transitions. [2019-12-27 06:15:38,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:15:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 24122 states and 73565 transitions. [2019-12-27 06:15:39,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:39,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:39,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:39,010 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:39,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:39,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1614859221, now seen corresponding path program 1 times [2019-12-27 06:15:39,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:39,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232102453] [2019-12-27 06:15:39,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:39,170 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-27 06:15:39,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232102453] [2019-12-27 06:15:39,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:39,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:15:39,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416896707] [2019-12-27 06:15:39,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:15:39,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:15:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:15:39,173 INFO L87 Difference]: Start difference. First operand 24122 states and 73565 transitions. Second operand 11 states. [2019-12-27 06:15:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:40,862 INFO L93 Difference]: Finished difference Result 55018 states and 166424 transitions. [2019-12-27 06:15:40,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 06:15:40,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 06:15:40,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:40,921 INFO L225 Difference]: With dead ends: 55018 [2019-12-27 06:15:40,921 INFO L226 Difference]: Without dead ends: 42799 [2019-12-27 06:15:40,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 06:15:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42799 states. [2019-12-27 06:15:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42799 to 23322. [2019-12-27 06:15:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23322 states. [2019-12-27 06:15:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23322 states to 23322 states and 70768 transitions. [2019-12-27 06:15:41,453 INFO L78 Accepts]: Start accepts. Automaton has 23322 states and 70768 transitions. Word has length 66 [2019-12-27 06:15:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:41,454 INFO L462 AbstractCegarLoop]: Abstraction has 23322 states and 70768 transitions. [2019-12-27 06:15:41,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:15:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23322 states and 70768 transitions. [2019-12-27 06:15:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:41,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:41,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:41,479 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 136153959, now seen corresponding path program 2 times [2019-12-27 06:15:41,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:41,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929748070] [2019-12-27 06:15:41,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:41,540 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-27 06:15:41,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929748070] [2019-12-27 06:15:41,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:41,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:41,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482049785] [2019-12-27 06:15:41,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:41,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:41,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:41,542 INFO L87 Difference]: Start difference. First operand 23322 states and 70768 transitions. Second operand 3 states. [2019-12-27 06:15:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:41,635 INFO L93 Difference]: Finished difference Result 23321 states and 70766 transitions. [2019-12-27 06:15:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:41,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:15:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:41,675 INFO L225 Difference]: With dead ends: 23321 [2019-12-27 06:15:41,675 INFO L226 Difference]: Without dead ends: 23321 [2019-12-27 06:15:41,676 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-27 06:15:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23321 states. [2019-12-27 06:15:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23321 to 19679. [2019-12-27 06:15:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19679 states. [2019-12-27 06:15:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19679 states to 19679 states and 60471 transitions. [2019-12-27 06:15:42,017 INFO L78 Accepts]: Start accepts. Automaton has 19679 states and 60471 transitions. Word has length 66 [2019-12-27 06:15:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:42,017 INFO L462 AbstractCegarLoop]: Abstraction has 19679 states and 60471 transitions. [2019-12-27 06:15:42,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 19679 states and 60471 transitions. [2019-12-27 06:15:42,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:42,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:42,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:42,038 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash 827602940, now seen corresponding path program 1 times [2019-12-27 06:15:42,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:42,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407910764] [2019-12-27 06:15:42,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:15:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:15:42,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:15:42,158 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:15:42,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= v_~b$flush_delayed~0_13 0) (= v_~__unbuffered_p1_EBX~0_14 0) (= 0 v_~a~0_8) (= v_~b$r_buff1_thd1~0_19 0) (= 0 v_~b$r_buff0_thd0~0_21) (= v_~b$r_buff1_thd2~0_18 0) (= 0 v_~b$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~y~0_7) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff0_thd1~0_29) (= v_~x~0_10 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t855~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t855~0.base_21|) |v_ULTIMATE.start_main_~#t855~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_24) (= 0 v_~z~0_7) (= v_~b$r_buff1_thd0~0_24 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t855~0.base_21| 4)) (= 0 v_~b$r_buff0_thd3~0_76) (= v_~b$read_delayed_var~0.offset_7 0) (= 0 v_~b$r_buff0_thd2~0_21) (= 0 |v_ULTIMATE.start_main_~#t855~0.offset_17|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~b$mem_tmp~0_10 0) (= v_~b$r_buff1_thd3~0_49 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~b$w_buff1_used~0_68) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t855~0.base_21| 1)) (= 0 v_~b$w_buff1~0_23) (= |v_#NULL.offset_4| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t855~0.base_21|) 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t855~0.base_21|) (= v_~b~0_28 0) (= 0 v_~b$w_buff0_used~0_110) (= 0 v_~b$read_delayed_var~0.base_7))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_76, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_19, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_110, ~a~0=v_~a~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ULTIMATE.start_main_~#t855~0.offset=|v_ULTIMATE.start_main_~#t855~0.offset_17|, ULTIMATE.start_main_~#t855~0.base=|v_ULTIMATE.start_main_~#t855~0.base_21|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_21, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_21, ~b$mem_tmp~0=v_~b$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~b$flush_delayed~0=v_~b$flush_delayed~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t856~0.offset=|v_ULTIMATE.start_main_~#t856~0.offset_17|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t857~0.offset=|v_ULTIMATE.start_main_~#t857~0.offset_17|, ~x~0=v_~x~0_10, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_68, ~y~0=v_~y~0_7, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t857~0.base=|v_ULTIMATE.start_main_~#t857~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t856~0.base=|v_ULTIMATE.start_main_~#t856~0.base_21|, ~b~0=v_~b~0_28, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_49} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t855~0.offset, ULTIMATE.start_main_~#t855~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t856~0.offset, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t857~0.offset, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t857~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t856~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:15:42,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L754: Formula: (and (= ~x~0_In1908922775 ~__unbuffered_p0_EAX~0_Out1908922775) (= ~b$r_buff1_thd3~0_Out1908922775 ~b$r_buff0_thd3~0_In1908922775) (= 1 ~b$r_buff0_thd1~0_Out1908922775) (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1908922775 0)) (= ~b$r_buff1_thd1~0_Out1908922775 ~b$r_buff0_thd1~0_In1908922775) (= ~b$r_buff0_thd2~0_In1908922775 ~b$r_buff1_thd2~0_Out1908922775) (= ~b$r_buff0_thd0~0_In1908922775 ~b$r_buff1_thd0~0_Out1908922775)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1908922775, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1908922775, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1908922775, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1908922775, ~x~0=~x~0_In1908922775, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1908922775} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1908922775, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1908922775, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1908922775, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1908922775, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1908922775, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1908922775, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1908922775, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1908922775, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1908922775, ~x~0=~x~0_In1908922775, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1908922775} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:15:42,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t856~0.base_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t856~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t856~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t856~0.base_10|) |v_ULTIMATE.start_main_~#t856~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t856~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t856~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t856~0.offset_9| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t856~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t856~0.base=|v_ULTIMATE.start_main_~#t856~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t856~0.offset=|v_ULTIMATE.start_main_~#t856~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t856~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t856~0.offset, #length] because there is no mapped edge [2019-12-27 06:15:42,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd2~0_In1589963394 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1589963394 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out1589963394| ~b$w_buff1~0_In1589963394)) (and (= ~b~0_In1589963394 |P1Thread1of1ForFork0_#t~ite9_Out1589963394|) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1589963394, ~b~0=~b~0_In1589963394, ~b$w_buff1~0=~b$w_buff1~0_In1589963394, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1589963394} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In1589963394, ~b~0=~b~0_In1589963394, ~b$w_buff1~0=~b$w_buff1~0_In1589963394, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out1589963394|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1589963394} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 06:15:42,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_23 |v_P1Thread1of1ForFork0_#t~ite9_8|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_8|} OutVars{~b~0=v_~b~0_23, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_7|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_7|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 06:15:42,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-1487066192 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-1487066192 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite11_Out-1487066192| ~b$w_buff0_used~0_In-1487066192)) (and (= |P1Thread1of1ForFork0_#t~ite11_Out-1487066192| 0) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1487066192, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1487066192} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1487066192, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1487066192, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1487066192|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:15:42,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff1_used~0_In2110532794 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In2110532794 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In2110532794 256))) (.cse1 (= (mod ~b$r_buff0_thd2~0_In2110532794 256) 0))) (or (and (= ~b$w_buff1_used~0_In2110532794 |P1Thread1of1ForFork0_#t~ite12_Out2110532794|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite12_Out2110532794|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2110532794, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In2110532794, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2110532794, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In2110532794} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2110532794, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In2110532794, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2110532794, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out2110532794|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In2110532794} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:15:42,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In891824981 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In891824981 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out891824981|) (not .cse1)) (and (= ~b$r_buff0_thd2~0_In891824981 |P1Thread1of1ForFork0_#t~ite13_Out891824981|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In891824981, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In891824981} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In891824981, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In891824981, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out891824981|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:15:42,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In-515522677 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-515522677 256) 0)) (.cse2 (= 0 (mod ~b$r_buff0_thd2~0_In-515522677 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In-515522677 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite14_Out-515522677| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite14_Out-515522677| ~b$r_buff1_thd2~0_In-515522677)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-515522677, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-515522677, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-515522677, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-515522677} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-515522677, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-515522677, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-515522677, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-515522677|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-515522677} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:15:42,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~b$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 06:15:42,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t857~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t857~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t857~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t857~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t857~0.base_13|) |v_ULTIMATE.start_main_~#t857~0.offset_11| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t857~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t857~0.base_13|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t857~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t857~0.base=|v_ULTIMATE.start_main_~#t857~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t857~0.offset=|v_ULTIMATE.start_main_~#t857~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t857~0.base, #length, ULTIMATE.start_main_~#t857~0.offset] because there is no mapped edge [2019-12-27 06:15:42,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In196435051 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out196435051| ~b$w_buff0~0_In196435051) (= |P2Thread1of1ForFork1_#t~ite20_In196435051| |P2Thread1of1ForFork1_#t~ite20_Out196435051|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite21_Out196435051| |P2Thread1of1ForFork1_#t~ite20_Out196435051|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In196435051 256)))) (or (= (mod ~b$w_buff0_used~0_In196435051 256) 0) (and .cse1 (= (mod ~b$w_buff1_used~0_In196435051 256) 0)) (and (= 0 (mod ~b$r_buff1_thd3~0_In196435051 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite20_Out196435051| ~b$w_buff0~0_In196435051) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In196435051, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In196435051, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In196435051|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In196435051, ~b$w_buff0~0=~b$w_buff0~0_In196435051, ~weak$$choice2~0=~weak$$choice2~0_In196435051, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In196435051} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In196435051, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In196435051, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out196435051|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out196435051|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In196435051, ~b$w_buff0~0=~b$w_buff0~0_In196435051, ~weak$$choice2~0=~weak$$choice2~0_In196435051, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In196435051} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:15:42,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-596614709 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite26_Out-596614709| ~b$w_buff0_used~0_In-596614709) (= |P2Thread1of1ForFork1_#t~ite26_Out-596614709| |P2Thread1of1ForFork1_#t~ite27_Out-596614709|) .cse0 (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-596614709 256) 0))) (or (and (= 0 (mod ~b$w_buff1_used~0_In-596614709 256)) .cse1) (= 0 (mod ~b$w_buff0_used~0_In-596614709 256)) (and (= (mod ~b$r_buff1_thd3~0_In-596614709 256) 0) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out-596614709| ~b$w_buff0_used~0_In-596614709) (= |P2Thread1of1ForFork1_#t~ite26_In-596614709| |P2Thread1of1ForFork1_#t~ite26_Out-596614709|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-596614709, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-596614709, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-596614709|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-596614709, ~weak$$choice2~0=~weak$$choice2~0_In-596614709, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-596614709} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-596614709, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-596614709|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-596614709, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-596614709|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-596614709, ~weak$$choice2~0=~weak$$choice2~0_In-596614709, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-596614709} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 06:15:42,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (= v_~b$r_buff0_thd3~0_49 v_~b$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_49, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:15:42,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (= v_~b~0_18 v_~b$mem_tmp~0_5) (not (= (mod v_~b$flush_delayed~0_8 256) 0))) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 06:15:42,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In894177691 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In894177691 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out894177691| ~b$w_buff1~0_In894177691) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out894177691| ~b~0_In894177691) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In894177691, ~b~0=~b~0_In894177691, ~b$w_buff1~0=~b$w_buff1~0_In894177691, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In894177691} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out894177691|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In894177691, ~b~0=~b~0_In894177691, ~b$w_buff1~0=~b$w_buff1~0_In894177691, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In894177691} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 06:15:42,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_20 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, ~b~0=v_~b~0_20, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 06:15:42,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1410789225 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1410789225 256) 0))) (or (and (= ~b$w_buff0_used~0_In-1410789225 |P2Thread1of1ForFork1_#t~ite40_Out-1410789225|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-1410789225|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1410789225, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1410789225} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1410789225, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1410789225, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1410789225|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 06:15:42,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1230442807 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1230442807 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd3~0_In-1230442807 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-1230442807 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out-1230442807| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite41_Out-1230442807| ~b$w_buff1_used~0_In-1230442807) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1230442807, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1230442807, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1230442807, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1230442807} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1230442807, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1230442807, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1230442807, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1230442807|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1230442807} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 06:15:42,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-1603551867 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-1603551867 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd3~0_In-1603551867 |P2Thread1of1ForFork1_#t~ite42_Out-1603551867|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1603551867|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1603551867, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1603551867} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1603551867, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1603551867, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1603551867|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 06:15:42,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In-2123046613 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-2123046613 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-2123046613 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-2123046613 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out-2123046613| ~b$r_buff1_thd3~0_In-2123046613) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite43_Out-2123046613| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2123046613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2123046613, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2123046613, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2123046613} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2123046613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2123046613, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-2123046613|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2123046613, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2123046613} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 06:15:42,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~b$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_42, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 06:15:42,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1242003515 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In1242003515 256)))) (or (and (= ~b$w_buff0_used~0_In1242003515 |P0Thread1of1ForFork2_#t~ite5_Out1242003515|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite5_Out1242003515| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1242003515, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1242003515} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1242003515, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1242003515, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1242003515|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:15:42,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In1113140487 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd1~0_In1113140487 256) 0)) (.cse1 (= 0 (mod ~b$r_buff1_thd1~0_In1113140487 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In1113140487 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out1113140487| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork2_#t~ite6_Out1113140487| ~b$w_buff1_used~0_In1113140487)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1113140487, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1113140487, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1113140487, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1113140487} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1113140487, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1113140487, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1113140487, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1113140487, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out1113140487|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:15:42,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-700060970 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-700060970 256)))) (or (and (= ~b$r_buff0_thd1~0_In-700060970 ~b$r_buff0_thd1~0_Out-700060970) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out-700060970)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-700060970, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-700060970} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-700060970, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-700060970, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-700060970|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:15:42,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff1_used~0_In206596393 256))) (.cse0 (= (mod ~b$r_buff1_thd1~0_In206596393 256) 0)) (.cse2 (= 0 (mod ~b$r_buff0_thd1~0_In206596393 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In206596393 256)))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite8_Out206596393|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~b$r_buff1_thd1~0_In206596393 |P0Thread1of1ForFork2_#t~ite8_Out206596393|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In206596393, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In206596393, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In206596393, ~b$w_buff1_used~0=~b$w_buff1_used~0_In206596393} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In206596393, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In206596393, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In206596393, ~b$w_buff1_used~0=~b$w_buff1_used~0_In206596393, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out206596393|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:15:42,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= v_~b$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork2_#t~ite8_8|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:15:42,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:15:42,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In-1456301977 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In-1456301977 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1456301977| ~b$w_buff1~0_In-1456301977) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1456301977| ~b~0_In-1456301977)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1456301977, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1456301977, ~b~0=~b~0_In-1456301977, ~b$w_buff1~0=~b$w_buff1~0_In-1456301977} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1456301977, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1456301977, ~b~0=~b~0_In-1456301977, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1456301977|, ~b$w_buff1~0=~b$w_buff1~0_In-1456301977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 06:15:42,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_21 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~b~0=v_~b~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:15:42,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd0~0_In359605079 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In359605079 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out359605079| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out359605079| ~b$w_buff0_used~0_In359605079)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In359605079, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In359605079} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In359605079, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out359605079|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In359605079} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:15:42,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd0~0_In-512266728 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-512266728 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-512266728 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-512266728 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-512266728|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-512266728 |ULTIMATE.start_main_#t~ite50_Out-512266728|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-512266728, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-512266728, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-512266728, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-512266728} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-512266728|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-512266728, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-512266728, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-512266728, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-512266728} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:15:42,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1323269510 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1323269510 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1323269510|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out1323269510| ~b$r_buff0_thd0~0_In1323269510) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1323269510, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1323269510} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1323269510, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1323269510|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1323269510} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:15:42,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd0~0_In-293296695 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In-293296695 256) 0)) (.cse2 (= 0 (mod ~b$r_buff0_thd0~0_In-293296695 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In-293296695 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-293296695| 0)) (and (= ~b$r_buff1_thd0~0_In-293296695 |ULTIMATE.start_main_#t~ite52_Out-293296695|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-293296695, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-293296695, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-293296695, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-293296695} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-293296695, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-293296695|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-293296695, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-293296695, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-293296695} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:15:42,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p2_EAX~0_5 1) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= v_~b$r_buff1_thd0~0_17 |v_ULTIMATE.start_main_#t~ite52_11|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:15:42,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:15:42 BasicIcfg [2019-12-27 06:15:42,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:15:42,268 INFO L168 Benchmark]: Toolchain (without parser) took 117614.31 ms. Allocated memory was 146.8 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 103.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:15:42,269 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:15:42,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.22 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 157.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:42,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:42,271 INFO L168 Benchmark]: Boogie Preprocessor took 38.95 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:42,271 INFO L168 Benchmark]: RCFGBuilder took 888.06 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.3 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:15:42,272 INFO L168 Benchmark]: TraceAbstraction took 115822.83 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. [2019-12-27 06:15:42,275 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.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.22 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.7 MB in the beginning and 157.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.95 ms. Allocated memory is still 203.9 MB. Free memory was 154.5 MB in the beginning and 152.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 888.06 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.3 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115822.83 ms. Allocated memory was 203.9 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 100.6 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 97 ProgramPointsAfterwards, 217 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7585 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86141 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t855, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t856, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t857, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 115.5s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6596 SDtfs, 9713 SDslu, 20467 SDs, 0 SdLazy, 9131 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176439occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 59.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 415139 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1295 NumberOfCodeBlocks, 1295 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1202 ConstructedInterpolants, 0 QuantifiedInterpolants, 220941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...