/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/mix010_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:19:59,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:19:59,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:19:59,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:19:59,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:19:59,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:19:59,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:19:59,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:19:59,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:19:59,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:19:59,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:19:59,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:19:59,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:19:59,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:19:59,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:19:59,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:19:59,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:19:59,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:19:59,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:19:59,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:19:59,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:19:59,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:19:59,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:19:59,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:19:59,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:19:59,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:19:59,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:19:59,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:19:59,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:19:59,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:19:59,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:19:59,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:19:59,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:19:59,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:19:59,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:19:59,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:19:59,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:19:59,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:19:59,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:19:59,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:19:59,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:19:59,468 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 05:19:59,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:19:59,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:19:59,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:19:59,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:19:59,505 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:19:59,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:19:59,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:19:59,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:19:59,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:19:59,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:19:59,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:19:59,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:19:59,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:19:59,506 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:19:59,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:19:59,507 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:19:59,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:19:59,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:19:59,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:19:59,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:19:59,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:19:59,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:19:59,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:19:59,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:19:59,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:19:59,509 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:19:59,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:19:59,509 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:19:59,509 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:19:59,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:19:59,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:19:59,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:19:59,793 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:19:59,795 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:19:59,795 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:19:59,796 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-27 05:19:59,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2605657/7b9f9318c0764488a3a93d6f60c82e25/FLAG3e44c42c8 [2019-12-27 05:20:00,475 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:20:00,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_power.oepc.i [2019-12-27 05:20:00,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2605657/7b9f9318c0764488a3a93d6f60c82e25/FLAG3e44c42c8 [2019-12-27 05:20:00,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2605657/7b9f9318c0764488a3a93d6f60c82e25 [2019-12-27 05:20:00,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:20:00,730 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:20:00,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:20:00,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:20:00,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:20:00,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:20:00" (1/1) ... [2019-12-27 05:20:00,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81a7e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:00, skipping insertion in model container [2019-12-27 05:20:00,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:20:00" (1/1) ... [2019-12-27 05:20:00,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:20:00,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:20:01,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:20:01,360 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:20:01,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:20:01,518 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:20:01,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01 WrapperNode [2019-12-27 05:20:01,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:20:01,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:20:01,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:20:01,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:20:01,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:20:01,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:20:01,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:20:01,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:20:01,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (1/1) ... [2019-12-27 05:20:01,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:20:01,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:20:01,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:20:01,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:20:01,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (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 05:20:01,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:20:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:20:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:20:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:20:01,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:20:01,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:20:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:20:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:20:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:20:01,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:20:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:20:01,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:20:01,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:20:01,699 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 05:20:02,442 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:20:02,443 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:20:02,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:20:02 BoogieIcfgContainer [2019-12-27 05:20:02,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:20:02,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:20:02,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:20:02,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:20:02,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:20:00" (1/3) ... [2019-12-27 05:20:02,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9bb66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:20:02, skipping insertion in model container [2019-12-27 05:20:02,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:20:01" (2/3) ... [2019-12-27 05:20:02,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9bb66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:20:02, skipping insertion in model container [2019-12-27 05:20:02,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:20:02" (3/3) ... [2019-12-27 05:20:02,458 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_power.oepc.i [2019-12-27 05:20:02,469 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:20:02,469 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:20:02,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:20:02,480 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:20:02,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,529 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,557 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,558 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,580 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,605 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,607 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,615 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,621 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,622 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:20:02,644 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:20:02,668 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:20:02,668 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:20:02,668 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:20:02,668 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:20:02,668 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:20:02,669 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:20:02,669 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:20:02,669 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:20:02,685 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 05:20:02,687 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:20:02,790 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:20:02,790 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:20:02,808 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:20:02,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 05:20:02,887 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 05:20:02,887 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:20:02,896 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:20:02,917 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:20:02,918 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:20:05,714 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 05:20:06,441 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 05:20:06,601 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 05:20:06,640 INFO L206 etLargeBlockEncoding]: Checked pairs total: 95714 [2019-12-27 05:20:06,641 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 05:20:06,645 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 108 transitions [2019-12-27 05:20:32,444 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 138242 states. [2019-12-27 05:20:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 138242 states. [2019-12-27 05:20:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:20:32,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:20:32,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:20:32,454 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 05:20:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:20:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 917980, now seen corresponding path program 1 times [2019-12-27 05:20:32,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:20:32,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057047436] [2019-12-27 05:20:32,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:20:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:20:32,770 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 05:20:32,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057047436] [2019-12-27 05:20:32,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:20:32,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:20:32,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984504910] [2019-12-27 05:20:32,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:20:32,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:20:32,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:20:32,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:20:32,799 INFO L87 Difference]: Start difference. First operand 138242 states. Second operand 3 states. [2019-12-27 05:20:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:20:34,677 INFO L93 Difference]: Finished difference Result 137016 states and 586554 transitions. [2019-12-27 05:20:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:20:34,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:20:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:20:35,466 INFO L225 Difference]: With dead ends: 137016 [2019-12-27 05:20:35,466 INFO L226 Difference]: Without dead ends: 128980 [2019-12-27 05:20:35,468 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 05:20:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128980 states. [2019-12-27 05:20:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128980 to 128980. [2019-12-27 05:20:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128980 states. [2019-12-27 05:20:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128980 states to 128980 states and 551484 transitions. [2019-12-27 05:20:52,527 INFO L78 Accepts]: Start accepts. Automaton has 128980 states and 551484 transitions. Word has length 3 [2019-12-27 05:20:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:20:52,528 INFO L462 AbstractCegarLoop]: Abstraction has 128980 states and 551484 transitions. [2019-12-27 05:20:52,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:20:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 128980 states and 551484 transitions. [2019-12-27 05:20:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:20:52,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:20:52,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:20:52,534 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 05:20:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:20:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash 178231614, now seen corresponding path program 1 times [2019-12-27 05:20:52,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:20:52,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314227535] [2019-12-27 05:20:52,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:20:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:20:52,620 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 05:20:52,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314227535] [2019-12-27 05:20:52,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:20:52,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:20:52,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992612999] [2019-12-27 05:20:52,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:20:52,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:20:52,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:20:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:20:52,624 INFO L87 Difference]: Start difference. First operand 128980 states and 551484 transitions. Second operand 4 states. [2019-12-27 05:20:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:20:59,040 INFO L93 Difference]: Finished difference Result 200378 states and 822381 transitions. [2019-12-27 05:20:59,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:20:59,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:20:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:20:59,778 INFO L225 Difference]: With dead ends: 200378 [2019-12-27 05:20:59,778 INFO L226 Difference]: Without dead ends: 200329 [2019-12-27 05:20:59,779 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 05:21:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200329 states. [2019-12-27 05:21:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200329 to 184385. [2019-12-27 05:21:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184385 states. [2019-12-27 05:21:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184385 states to 184385 states and 766782 transitions. [2019-12-27 05:21:18,141 INFO L78 Accepts]: Start accepts. Automaton has 184385 states and 766782 transitions. Word has length 11 [2019-12-27 05:21:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:18,143 INFO L462 AbstractCegarLoop]: Abstraction has 184385 states and 766782 transitions. [2019-12-27 05:21:18,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 184385 states and 766782 transitions. [2019-12-27 05:21:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:21:18,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:18,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:18,150 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 05:21:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash -786514357, now seen corresponding path program 1 times [2019-12-27 05:21:18,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:18,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785563753] [2019-12-27 05:21:18,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:18,206 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 05:21:18,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785563753] [2019-12-27 05:21:18,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:18,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:18,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313916110] [2019-12-27 05:21:18,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:18,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:18,210 INFO L87 Difference]: Start difference. First operand 184385 states and 766782 transitions. Second operand 3 states. [2019-12-27 05:21:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:18,351 INFO L93 Difference]: Finished difference Result 38211 states and 124394 transitions. [2019-12-27 05:21:18,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:18,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:21:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:18,415 INFO L225 Difference]: With dead ends: 38211 [2019-12-27 05:21:18,416 INFO L226 Difference]: Without dead ends: 38211 [2019-12-27 05:21:18,416 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 05:21:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38211 states. [2019-12-27 05:21:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38211 to 38211. [2019-12-27 05:21:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38211 states. [2019-12-27 05:21:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38211 states to 38211 states and 124394 transitions. [2019-12-27 05:21:20,575 INFO L78 Accepts]: Start accepts. Automaton has 38211 states and 124394 transitions. Word has length 13 [2019-12-27 05:21:20,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:20,575 INFO L462 AbstractCegarLoop]: Abstraction has 38211 states and 124394 transitions. [2019-12-27 05:21:20,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:20,575 INFO L276 IsEmpty]: Start isEmpty. Operand 38211 states and 124394 transitions. [2019-12-27 05:21:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:21:20,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:20,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:21:20,579 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 05:21:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1326052248, now seen corresponding path program 1 times [2019-12-27 05:21:20,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:20,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126888677] [2019-12-27 05:21:20,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:20,684 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 05:21:20,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126888677] [2019-12-27 05:21:20,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:20,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:20,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904578749] [2019-12-27 05:21:20,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:20,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:20,688 INFO L87 Difference]: Start difference. First operand 38211 states and 124394 transitions. Second operand 5 states. [2019-12-27 05:21:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:21,207 INFO L93 Difference]: Finished difference Result 52954 states and 170202 transitions. [2019-12-27 05:21:21,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:21:21,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:21:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:21,296 INFO L225 Difference]: With dead ends: 52954 [2019-12-27 05:21:21,296 INFO L226 Difference]: Without dead ends: 52954 [2019-12-27 05:21:21,296 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 05:21:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52954 states. [2019-12-27 05:21:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52954 to 45311. [2019-12-27 05:21:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45311 states. [2019-12-27 05:21:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45311 states to 45311 states and 146879 transitions. [2019-12-27 05:21:22,176 INFO L78 Accepts]: Start accepts. Automaton has 45311 states and 146879 transitions. Word has length 16 [2019-12-27 05:21:22,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:22,176 INFO L462 AbstractCegarLoop]: Abstraction has 45311 states and 146879 transitions. [2019-12-27 05:21:22,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 45311 states and 146879 transitions. [2019-12-27 05:21:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:21:22,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:22,189 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 05:21:22,189 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 05:21:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash 572858118, now seen corresponding path program 1 times [2019-12-27 05:21:22,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:22,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089547943] [2019-12-27 05:21:22,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:23,472 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 05:21:23,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089547943] [2019-12-27 05:21:23,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:23,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:21:23,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166916054] [2019-12-27 05:21:23,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:21:23,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:23,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:21:23,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:23,474 INFO L87 Difference]: Start difference. First operand 45311 states and 146879 transitions. Second operand 7 states. [2019-12-27 05:21:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:24,714 INFO L93 Difference]: Finished difference Result 72804 states and 228787 transitions. [2019-12-27 05:21:24,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:21:24,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 05:21:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:24,839 INFO L225 Difference]: With dead ends: 72804 [2019-12-27 05:21:24,839 INFO L226 Difference]: Without dead ends: 72790 [2019-12-27 05:21:24,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:21:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72790 states. [2019-12-27 05:21:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72790 to 44975. [2019-12-27 05:21:25,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44975 states. [2019-12-27 05:21:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44975 states to 44975 states and 144930 transitions. [2019-12-27 05:21:26,950 INFO L78 Accepts]: Start accepts. Automaton has 44975 states and 144930 transitions. Word has length 22 [2019-12-27 05:21:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:26,951 INFO L462 AbstractCegarLoop]: Abstraction has 44975 states and 144930 transitions. [2019-12-27 05:21:26,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:21:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 44975 states and 144930 transitions. [2019-12-27 05:21:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:21:26,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:26,969 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 05:21:26,969 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 05:21:26,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash -775936505, now seen corresponding path program 1 times [2019-12-27 05:21:26,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:26,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071162690] [2019-12-27 05:21:26,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:27,052 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 05:21:27,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071162690] [2019-12-27 05:21:27,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:27,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:27,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909195528] [2019-12-27 05:21:27,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:21:27,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:27,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:21:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:21:27,055 INFO L87 Difference]: Start difference. First operand 44975 states and 144930 transitions. Second operand 4 states. [2019-12-27 05:21:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:27,142 INFO L93 Difference]: Finished difference Result 18102 states and 54995 transitions. [2019-12-27 05:21:27,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:21:27,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:21:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:27,168 INFO L225 Difference]: With dead ends: 18102 [2019-12-27 05:21:27,168 INFO L226 Difference]: Without dead ends: 18102 [2019-12-27 05:21:27,168 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 05:21:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18102 states. [2019-12-27 05:21:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18102 to 17802. [2019-12-27 05:21:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17802 states. [2019-12-27 05:21:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17802 states to 17802 states and 54181 transitions. [2019-12-27 05:21:27,449 INFO L78 Accepts]: Start accepts. Automaton has 17802 states and 54181 transitions. Word has length 25 [2019-12-27 05:21:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:27,449 INFO L462 AbstractCegarLoop]: Abstraction has 17802 states and 54181 transitions. [2019-12-27 05:21:27,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17802 states and 54181 transitions. [2019-12-27 05:21:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:21:27,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:27,462 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 05:21:27,463 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 05:21:27,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:27,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1393972684, now seen corresponding path program 1 times [2019-12-27 05:21:27,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:27,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719611422] [2019-12-27 05:21:27,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:27,548 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 05:21:27,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719611422] [2019-12-27 05:21:27,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:27,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:21:27,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691758222] [2019-12-27 05:21:27,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:21:27,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:21:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:21:27,551 INFO L87 Difference]: Start difference. First operand 17802 states and 54181 transitions. Second operand 6 states. [2019-12-27 05:21:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:28,272 INFO L93 Difference]: Finished difference Result 25666 states and 75651 transitions. [2019-12-27 05:21:28,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:21:28,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:21:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:28,323 INFO L225 Difference]: With dead ends: 25666 [2019-12-27 05:21:28,323 INFO L226 Difference]: Without dead ends: 25666 [2019-12-27 05:21:28,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:21:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25666 states. [2019-12-27 05:21:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25666 to 20719. [2019-12-27 05:21:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20719 states. [2019-12-27 05:21:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20719 states to 20719 states and 62283 transitions. [2019-12-27 05:21:28,680 INFO L78 Accepts]: Start accepts. Automaton has 20719 states and 62283 transitions. Word has length 27 [2019-12-27 05:21:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:28,681 INFO L462 AbstractCegarLoop]: Abstraction has 20719 states and 62283 transitions. [2019-12-27 05:21:28,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:21:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20719 states and 62283 transitions. [2019-12-27 05:21:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:21:28,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:28,701 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 05:21:28,702 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 05:21:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1695040076, now seen corresponding path program 1 times [2019-12-27 05:21:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:28,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475569614] [2019-12-27 05:21:28,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:28,767 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 05:21:28,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475569614] [2019-12-27 05:21:28,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:28,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:28,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259151202] [2019-12-27 05:21:28,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:28,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:28,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:28,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:28,769 INFO L87 Difference]: Start difference. First operand 20719 states and 62283 transitions. Second operand 5 states. [2019-12-27 05:21:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:29,185 INFO L93 Difference]: Finished difference Result 25941 states and 77027 transitions. [2019-12-27 05:21:29,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:21:29,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 05:21:29,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:29,223 INFO L225 Difference]: With dead ends: 25941 [2019-12-27 05:21:29,224 INFO L226 Difference]: Without dead ends: 25941 [2019-12-27 05:21:29,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25941 states. [2019-12-27 05:21:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25941 to 21961. [2019-12-27 05:21:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21961 states. [2019-12-27 05:21:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21961 states to 21961 states and 66303 transitions. [2019-12-27 05:21:30,357 INFO L78 Accepts]: Start accepts. Automaton has 21961 states and 66303 transitions. Word has length 33 [2019-12-27 05:21:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:30,357 INFO L462 AbstractCegarLoop]: Abstraction has 21961 states and 66303 transitions. [2019-12-27 05:21:30,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 21961 states and 66303 transitions. [2019-12-27 05:21:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:21:30,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:30,383 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 05:21:30,383 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 05:21:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash 843232464, now seen corresponding path program 2 times [2019-12-27 05:21:30,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:30,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940585600] [2019-12-27 05:21:30,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:30,491 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 05:21:30,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940585600] [2019-12-27 05:21:30,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:30,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:30,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949410123] [2019-12-27 05:21:30,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:21:30,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:21:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:21:30,496 INFO L87 Difference]: Start difference. First operand 21961 states and 66303 transitions. Second operand 8 states. [2019-12-27 05:21:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:31,937 INFO L93 Difference]: Finished difference Result 29973 states and 87406 transitions. [2019-12-27 05:21:31,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 05:21:31,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 05:21:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:31,978 INFO L225 Difference]: With dead ends: 29973 [2019-12-27 05:21:31,979 INFO L226 Difference]: Without dead ends: 29973 [2019-12-27 05:21:31,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:21:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29973 states. [2019-12-27 05:21:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29973 to 18923. [2019-12-27 05:21:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18923 states. [2019-12-27 05:21:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18923 states to 18923 states and 56662 transitions. [2019-12-27 05:21:32,340 INFO L78 Accepts]: Start accepts. Automaton has 18923 states and 56662 transitions. Word has length 33 [2019-12-27 05:21:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:32,340 INFO L462 AbstractCegarLoop]: Abstraction has 18923 states and 56662 transitions. [2019-12-27 05:21:32,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:21:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18923 states and 56662 transitions. [2019-12-27 05:21:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:21:32,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:32,362 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 05:21:32,363 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 05:21:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:32,363 INFO L82 PathProgramCache]: Analyzing trace with hash 353210315, now seen corresponding path program 1 times [2019-12-27 05:21:32,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:32,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394088058] [2019-12-27 05:21:32,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:32,424 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 05:21:32,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394088058] [2019-12-27 05:21:32,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:32,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:21:32,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920821079] [2019-12-27 05:21:32,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:32,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:32,426 INFO L87 Difference]: Start difference. First operand 18923 states and 56662 transitions. Second operand 3 states. [2019-12-27 05:21:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:32,500 INFO L93 Difference]: Finished difference Result 18922 states and 56660 transitions. [2019-12-27 05:21:32,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:32,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:21:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:32,527 INFO L225 Difference]: With dead ends: 18922 [2019-12-27 05:21:32,528 INFO L226 Difference]: Without dead ends: 18922 [2019-12-27 05:21:32,528 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 05:21:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18922 states. [2019-12-27 05:21:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18922 to 18922. [2019-12-27 05:21:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18922 states. [2019-12-27 05:21:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18922 states to 18922 states and 56660 transitions. [2019-12-27 05:21:34,276 INFO L78 Accepts]: Start accepts. Automaton has 18922 states and 56660 transitions. Word has length 39 [2019-12-27 05:21:34,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:34,277 INFO L462 AbstractCegarLoop]: Abstraction has 18922 states and 56660 transitions. [2019-12-27 05:21:34,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 18922 states and 56660 transitions. [2019-12-27 05:21:34,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:21:34,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:34,295 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 05:21:34,295 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 05:21:34,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:34,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1411726100, now seen corresponding path program 1 times [2019-12-27 05:21:34,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:34,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132625674] [2019-12-27 05:21:34,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:34,397 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 05:21:34,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132625674] [2019-12-27 05:21:34,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:34,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:34,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845900053] [2019-12-27 05:21:34,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:21:34,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:21:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:21:34,400 INFO L87 Difference]: Start difference. First operand 18922 states and 56660 transitions. Second operand 6 states. [2019-12-27 05:21:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:35,430 INFO L93 Difference]: Finished difference Result 37537 states and 112068 transitions. [2019-12-27 05:21:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:21:35,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 05:21:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:35,489 INFO L225 Difference]: With dead ends: 37537 [2019-12-27 05:21:35,491 INFO L226 Difference]: Without dead ends: 37537 [2019-12-27 05:21:35,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37537 states. [2019-12-27 05:21:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37537 to 23985. [2019-12-27 05:21:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23985 states. [2019-12-27 05:21:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23985 states to 23985 states and 71737 transitions. [2019-12-27 05:21:35,950 INFO L78 Accepts]: Start accepts. Automaton has 23985 states and 71737 transitions. Word has length 40 [2019-12-27 05:21:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:35,950 INFO L462 AbstractCegarLoop]: Abstraction has 23985 states and 71737 transitions. [2019-12-27 05:21:35,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:21:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 23985 states and 71737 transitions. [2019-12-27 05:21:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:21:35,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:35,974 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 05:21:35,974 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 05:21:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1919201076, now seen corresponding path program 2 times [2019-12-27 05:21:35,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:35,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927524772] [2019-12-27 05:21:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:36,054 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 05:21:36,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927524772] [2019-12-27 05:21:36,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:36,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:21:36,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160375061] [2019-12-27 05:21:36,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:36,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:36,056 INFO L87 Difference]: Start difference. First operand 23985 states and 71737 transitions. Second operand 5 states. [2019-12-27 05:21:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:36,731 INFO L93 Difference]: Finished difference Result 32203 states and 96114 transitions. [2019-12-27 05:21:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:21:36,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:21:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:36,778 INFO L225 Difference]: With dead ends: 32203 [2019-12-27 05:21:36,778 INFO L226 Difference]: Without dead ends: 32203 [2019-12-27 05:21:36,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:21:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32203 states. [2019-12-27 05:21:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32203 to 28899. [2019-12-27 05:21:37,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28899 states. [2019-12-27 05:21:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28899 states to 28899 states and 86897 transitions. [2019-12-27 05:21:37,460 INFO L78 Accepts]: Start accepts. Automaton has 28899 states and 86897 transitions. Word has length 40 [2019-12-27 05:21:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:37,461 INFO L462 AbstractCegarLoop]: Abstraction has 28899 states and 86897 transitions. [2019-12-27 05:21:37,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 28899 states and 86897 transitions. [2019-12-27 05:21:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:21:37,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:37,504 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 05:21:37,504 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 05:21:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1859885306, now seen corresponding path program 3 times [2019-12-27 05:21:37,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:37,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384509776] [2019-12-27 05:21:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:37,609 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 05:21:37,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384509776] [2019-12-27 05:21:37,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:37,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:37,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643610005] [2019-12-27 05:21:37,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:37,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:37,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:37,615 INFO L87 Difference]: Start difference. First operand 28899 states and 86897 transitions. Second operand 3 states. [2019-12-27 05:21:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:37,743 INFO L93 Difference]: Finished difference Result 28818 states and 86645 transitions. [2019-12-27 05:21:37,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:37,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:21:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:37,784 INFO L225 Difference]: With dead ends: 28818 [2019-12-27 05:21:37,784 INFO L226 Difference]: Without dead ends: 28818 [2019-12-27 05:21:37,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28818 states. [2019-12-27 05:21:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28818 to 24592. [2019-12-27 05:21:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24592 states. [2019-12-27 05:21:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24592 states to 24592 states and 74947 transitions. [2019-12-27 05:21:38,207 INFO L78 Accepts]: Start accepts. Automaton has 24592 states and 74947 transitions. Word has length 40 [2019-12-27 05:21:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:38,208 INFO L462 AbstractCegarLoop]: Abstraction has 24592 states and 74947 transitions. [2019-12-27 05:21:38,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 24592 states and 74947 transitions. [2019-12-27 05:21:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 05:21:38,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:38,233 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] [2019-12-27 05:21:38,233 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 05:21:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1927216762, now seen corresponding path program 1 times [2019-12-27 05:21:38,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:38,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920142140] [2019-12-27 05:21:38,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:38,293 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 05:21:38,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920142140] [2019-12-27 05:21:38,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:38,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:21:38,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111193762] [2019-12-27 05:21:38,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:21:38,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:38,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:21:38,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:21:38,295 INFO L87 Difference]: Start difference. First operand 24592 states and 74947 transitions. Second operand 5 states. [2019-12-27 05:21:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:38,392 INFO L93 Difference]: Finished difference Result 23362 states and 72210 transitions. [2019-12-27 05:21:38,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:21:38,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 05:21:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:38,424 INFO L225 Difference]: With dead ends: 23362 [2019-12-27 05:21:38,425 INFO L226 Difference]: Without dead ends: 22051 [2019-12-27 05:21:38,425 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 05:21:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22051 states. [2019-12-27 05:21:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22051 to 22051. [2019-12-27 05:21:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22051 states. [2019-12-27 05:21:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22051 states to 22051 states and 68868 transitions. [2019-12-27 05:21:38,971 INFO L78 Accepts]: Start accepts. Automaton has 22051 states and 68868 transitions. Word has length 41 [2019-12-27 05:21:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:38,971 INFO L462 AbstractCegarLoop]: Abstraction has 22051 states and 68868 transitions. [2019-12-27 05:21:38,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:21:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22051 states and 68868 transitions. [2019-12-27 05:21:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:38,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:38,995 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 05:21:38,995 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 05:21:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash 359338126, now seen corresponding path program 1 times [2019-12-27 05:21:38,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:38,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466392804] [2019-12-27 05:21:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:39,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466392804] [2019-12-27 05:21:39,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:39,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:21:39,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736442991] [2019-12-27 05:21:39,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:39,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:39,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:39,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:39,051 INFO L87 Difference]: Start difference. First operand 22051 states and 68868 transitions. Second operand 3 states. [2019-12-27 05:21:39,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:39,229 INFO L93 Difference]: Finished difference Result 29595 states and 93088 transitions. [2019-12-27 05:21:39,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:39,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:21:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:39,287 INFO L225 Difference]: With dead ends: 29595 [2019-12-27 05:21:39,287 INFO L226 Difference]: Without dead ends: 29595 [2019-12-27 05:21:39,287 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 05:21:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29595 states. [2019-12-27 05:21:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29595 to 23831. [2019-12-27 05:21:39,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23831 states. [2019-12-27 05:21:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23831 states to 23831 states and 75499 transitions. [2019-12-27 05:21:39,703 INFO L78 Accepts]: Start accepts. Automaton has 23831 states and 75499 transitions. Word has length 65 [2019-12-27 05:21:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:39,703 INFO L462 AbstractCegarLoop]: Abstraction has 23831 states and 75499 transitions. [2019-12-27 05:21:39,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 23831 states and 75499 transitions. [2019-12-27 05:21:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:39,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:39,727 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 05:21:39,727 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 05:21:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1347625235, now seen corresponding path program 1 times [2019-12-27 05:21:39,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:39,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166859716] [2019-12-27 05:21:39,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:39,822 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 05:21:39,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166859716] [2019-12-27 05:21:39,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:39,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:39,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844476284] [2019-12-27 05:21:39,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:21:39,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:39,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:21:39,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:39,824 INFO L87 Difference]: Start difference. First operand 23831 states and 75499 transitions. Second operand 7 states. [2019-12-27 05:21:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:40,332 INFO L93 Difference]: Finished difference Result 62749 states and 198693 transitions. [2019-12-27 05:21:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:21:40,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:21:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:40,413 INFO L225 Difference]: With dead ends: 62749 [2019-12-27 05:21:40,413 INFO L226 Difference]: Without dead ends: 47750 [2019-12-27 05:21:40,414 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 05:21:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47750 states. [2019-12-27 05:21:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47750 to 28081. [2019-12-27 05:21:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28081 states. [2019-12-27 05:21:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28081 states to 28081 states and 89069 transitions. [2019-12-27 05:21:41,242 INFO L78 Accepts]: Start accepts. Automaton has 28081 states and 89069 transitions. Word has length 65 [2019-12-27 05:21:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:41,242 INFO L462 AbstractCegarLoop]: Abstraction has 28081 states and 89069 transitions. [2019-12-27 05:21:41,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:21:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28081 states and 89069 transitions. [2019-12-27 05:21:41,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:41,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:41,275 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 05:21:41,275 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 05:21:41,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:41,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1859069805, now seen corresponding path program 2 times [2019-12-27 05:21:41,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:41,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396307918] [2019-12-27 05:21:41,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:21:41,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396307918] [2019-12-27 05:21:41,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:41,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:21:41,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59744288] [2019-12-27 05:21:41,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:21:41,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:41,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:21:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:21:41,366 INFO L87 Difference]: Start difference. First operand 28081 states and 89069 transitions. Second operand 7 states. [2019-12-27 05:21:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:41,906 INFO L93 Difference]: Finished difference Result 68805 states and 215395 transitions. [2019-12-27 05:21:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:21:41,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:21:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:41,984 INFO L225 Difference]: With dead ends: 68805 [2019-12-27 05:21:41,984 INFO L226 Difference]: Without dead ends: 49641 [2019-12-27 05:21:41,985 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 05:21:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49641 states. [2019-12-27 05:21:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49641 to 32073. [2019-12-27 05:21:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32073 states. [2019-12-27 05:21:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32073 states to 32073 states and 101393 transitions. [2019-12-27 05:21:42,978 INFO L78 Accepts]: Start accepts. Automaton has 32073 states and 101393 transitions. Word has length 65 [2019-12-27 05:21:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:42,979 INFO L462 AbstractCegarLoop]: Abstraction has 32073 states and 101393 transitions. [2019-12-27 05:21:42,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:21:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32073 states and 101393 transitions. [2019-12-27 05:21:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:43,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:43,017 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 05:21:43,017 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 05:21:43,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1166151863, now seen corresponding path program 3 times [2019-12-27 05:21:43,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:43,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060818704] [2019-12-27 05:21:43,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:43,112 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 05:21:43,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060818704] [2019-12-27 05:21:43,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:43,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:21:43,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031983340] [2019-12-27 05:21:43,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:21:43,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:21:43,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:21:43,114 INFO L87 Difference]: Start difference. First operand 32073 states and 101393 transitions. Second operand 8 states. [2019-12-27 05:21:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:44,244 INFO L93 Difference]: Finished difference Result 83655 states and 263314 transitions. [2019-12-27 05:21:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:21:44,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:21:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:44,362 INFO L225 Difference]: With dead ends: 83655 [2019-12-27 05:21:44,363 INFO L226 Difference]: Without dead ends: 74383 [2019-12-27 05:21:44,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:21:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74383 states. [2019-12-27 05:21:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74383 to 32593. [2019-12-27 05:21:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32593 states. [2019-12-27 05:21:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32593 states to 32593 states and 103411 transitions. [2019-12-27 05:21:45,572 INFO L78 Accepts]: Start accepts. Automaton has 32593 states and 103411 transitions. Word has length 65 [2019-12-27 05:21:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:45,573 INFO L462 AbstractCegarLoop]: Abstraction has 32593 states and 103411 transitions. [2019-12-27 05:21:45,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:21:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states and 103411 transitions. [2019-12-27 05:21:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:45,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:45,609 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 05:21:45,609 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 05:21:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1738755691, now seen corresponding path program 4 times [2019-12-27 05:21:45,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:45,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758482752] [2019-12-27 05:21:45,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:45,723 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 05:21:45,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758482752] [2019-12-27 05:21:45,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:45,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:21:45,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528108541] [2019-12-27 05:21:45,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:21:45,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:45,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:21:45,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:45,726 INFO L87 Difference]: Start difference. First operand 32593 states and 103411 transitions. Second operand 9 states. [2019-12-27 05:21:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:47,220 INFO L93 Difference]: Finished difference Result 101882 states and 317043 transitions. [2019-12-27 05:21:47,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 05:21:47,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:21:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:47,361 INFO L225 Difference]: With dead ends: 101882 [2019-12-27 05:21:47,361 INFO L226 Difference]: Without dead ends: 89306 [2019-12-27 05:21:47,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:21:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89306 states. [2019-12-27 05:21:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89306 to 32629. [2019-12-27 05:21:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32629 states. [2019-12-27 05:21:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32629 states to 32629 states and 103568 transitions. [2019-12-27 05:21:48,729 INFO L78 Accepts]: Start accepts. Automaton has 32629 states and 103568 transitions. Word has length 65 [2019-12-27 05:21:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:48,730 INFO L462 AbstractCegarLoop]: Abstraction has 32629 states and 103568 transitions. [2019-12-27 05:21:48,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:21:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 32629 states and 103568 transitions. [2019-12-27 05:21:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:48,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:48,767 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 05:21:48,767 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 05:21:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2043240447, now seen corresponding path program 5 times [2019-12-27 05:21:48,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:48,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181150420] [2019-12-27 05:21:48,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:48,893 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 05:21:48,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181150420] [2019-12-27 05:21:48,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:48,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:21:48,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935613035] [2019-12-27 05:21:48,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:21:48,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:21:48,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:48,896 INFO L87 Difference]: Start difference. First operand 32629 states and 103568 transitions. Second operand 9 states. [2019-12-27 05:21:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:50,356 INFO L93 Difference]: Finished difference Result 113630 states and 353091 transitions. [2019-12-27 05:21:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 05:21:50,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:21:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:50,520 INFO L225 Difference]: With dead ends: 113630 [2019-12-27 05:21:50,520 INFO L226 Difference]: Without dead ends: 105070 [2019-12-27 05:21:50,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:21:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105070 states. [2019-12-27 05:21:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105070 to 32666. [2019-12-27 05:21:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32666 states. [2019-12-27 05:21:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32666 states to 32666 states and 103730 transitions. [2019-12-27 05:21:51,943 INFO L78 Accepts]: Start accepts. Automaton has 32666 states and 103730 transitions. Word has length 65 [2019-12-27 05:21:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:51,944 INFO L462 AbstractCegarLoop]: Abstraction has 32666 states and 103730 transitions. [2019-12-27 05:21:51,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:21:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 32666 states and 103730 transitions. [2019-12-27 05:21:51,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:21:51,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:51,978 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 05:21:51,979 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 05:21:51,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:51,979 INFO L82 PathProgramCache]: Analyzing trace with hash -20463533, now seen corresponding path program 6 times [2019-12-27 05:21:51,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:51,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159039272] [2019-12-27 05:21:51,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:52,048 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 05:21:52,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159039272] [2019-12-27 05:21:52,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:52,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:21:52,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276440719] [2019-12-27 05:21:52,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:21:52,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:21:52,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:21:52,050 INFO L87 Difference]: Start difference. First operand 32666 states and 103730 transitions. Second operand 3 states. [2019-12-27 05:21:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:52,256 INFO L93 Difference]: Finished difference Result 38120 states and 120184 transitions. [2019-12-27 05:21:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:21:52,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:21:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:52,311 INFO L225 Difference]: With dead ends: 38120 [2019-12-27 05:21:52,311 INFO L226 Difference]: Without dead ends: 38120 [2019-12-27 05:21:52,312 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 05:21:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38120 states. [2019-12-27 05:21:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38120 to 33450. [2019-12-27 05:21:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33450 states. [2019-12-27 05:21:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33450 states to 33450 states and 106577 transitions. [2019-12-27 05:21:52,890 INFO L78 Accepts]: Start accepts. Automaton has 33450 states and 106577 transitions. Word has length 65 [2019-12-27 05:21:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:52,891 INFO L462 AbstractCegarLoop]: Abstraction has 33450 states and 106577 transitions. [2019-12-27 05:21:52,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:21:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33450 states and 106577 transitions. [2019-12-27 05:21:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:21:52,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:52,938 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 05:21:52,938 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 05:21:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1278998798, now seen corresponding path program 1 times [2019-12-27 05:21:52,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:52,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26791926] [2019-12-27 05:21:52,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:53,265 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 05:21:53,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26791926] [2019-12-27 05:21:53,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:53,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:21:53,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442687701] [2019-12-27 05:21:53,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:21:53,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:53,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:21:53,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:21:53,269 INFO L87 Difference]: Start difference. First operand 33450 states and 106577 transitions. Second operand 4 states. [2019-12-27 05:21:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:53,645 INFO L93 Difference]: Finished difference Result 50231 states and 159658 transitions. [2019-12-27 05:21:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:21:53,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 05:21:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:53,729 INFO L225 Difference]: With dead ends: 50231 [2019-12-27 05:21:53,729 INFO L226 Difference]: Without dead ends: 50231 [2019-12-27 05:21:53,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:21:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50231 states. [2019-12-27 05:21:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50231 to 36246. [2019-12-27 05:21:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36246 states. [2019-12-27 05:21:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36246 states to 36246 states and 116509 transitions. [2019-12-27 05:21:54,458 INFO L78 Accepts]: Start accepts. Automaton has 36246 states and 116509 transitions. Word has length 66 [2019-12-27 05:21:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:54,459 INFO L462 AbstractCegarLoop]: Abstraction has 36246 states and 116509 transitions. [2019-12-27 05:21:54,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 36246 states and 116509 transitions. [2019-12-27 05:21:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:21:54,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:54,500 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 05:21:54,500 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 05:21:54,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash 438587114, now seen corresponding path program 2 times [2019-12-27 05:21:54,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:54,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211167858] [2019-12-27 05:21:54,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:54,573 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 05:21:54,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211167858] [2019-12-27 05:21:54,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:54,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:21:54,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665349026] [2019-12-27 05:21:54,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:21:54,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:54,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:21:54,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:21:54,575 INFO L87 Difference]: Start difference. First operand 36246 states and 116509 transitions. Second operand 4 states. [2019-12-27 05:21:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:54,831 INFO L93 Difference]: Finished difference Result 44212 states and 140524 transitions. [2019-12-27 05:21:54,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:21:54,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 05:21:54,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:54,896 INFO L225 Difference]: With dead ends: 44212 [2019-12-27 05:21:54,896 INFO L226 Difference]: Without dead ends: 44212 [2019-12-27 05:21:54,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 05:21:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44212 states. [2019-12-27 05:21:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44212 to 36317. [2019-12-27 05:21:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36317 states. [2019-12-27 05:21:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36317 states to 36317 states and 116799 transitions. [2019-12-27 05:21:55,785 INFO L78 Accepts]: Start accepts. Automaton has 36317 states and 116799 transitions. Word has length 66 [2019-12-27 05:21:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:55,785 INFO L462 AbstractCegarLoop]: Abstraction has 36317 states and 116799 transitions. [2019-12-27 05:21:55,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:21:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 36317 states and 116799 transitions. [2019-12-27 05:21:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:21:55,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:55,824 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 05:21:55,824 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 05:21:55,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1493977688, now seen corresponding path program 3 times [2019-12-27 05:21:55,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:55,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612135335] [2019-12-27 05:21:55,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:55,917 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 05:21:55,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612135335] [2019-12-27 05:21:55,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:55,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:21:55,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312895507] [2019-12-27 05:21:55,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:21:55,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:21:55,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:21:55,919 INFO L87 Difference]: Start difference. First operand 36317 states and 116799 transitions. Second operand 8 states. [2019-12-27 05:21:57,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:21:57,139 INFO L93 Difference]: Finished difference Result 108826 states and 341914 transitions. [2019-12-27 05:21:57,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:21:57,140 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 05:21:57,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:21:57,300 INFO L225 Difference]: With dead ends: 108826 [2019-12-27 05:21:57,300 INFO L226 Difference]: Without dead ends: 96852 [2019-12-27 05:21:57,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:21:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96852 states. [2019-12-27 05:21:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96852 to 36319. [2019-12-27 05:21:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36319 states. [2019-12-27 05:21:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36319 states to 36319 states and 116796 transitions. [2019-12-27 05:21:58,771 INFO L78 Accepts]: Start accepts. Automaton has 36319 states and 116796 transitions. Word has length 66 [2019-12-27 05:21:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:21:58,771 INFO L462 AbstractCegarLoop]: Abstraction has 36319 states and 116796 transitions. [2019-12-27 05:21:58,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:21:58,772 INFO L276 IsEmpty]: Start isEmpty. Operand 36319 states and 116796 transitions. [2019-12-27 05:21:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:21:58,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:21:58,813 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 05:21:58,813 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 05:21:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:21:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash 183520316, now seen corresponding path program 4 times [2019-12-27 05:21:58,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:21:58,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248501923] [2019-12-27 05:21:58,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:21:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:21:58,921 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 05:21:58,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248501923] [2019-12-27 05:21:58,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:21:58,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:21:58,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328921191] [2019-12-27 05:21:58,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:21:58,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:21:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:21:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:21:58,923 INFO L87 Difference]: Start difference. First operand 36319 states and 116796 transitions. Second operand 9 states. [2019-12-27 05:22:00,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:00,495 INFO L93 Difference]: Finished difference Result 126434 states and 397052 transitions. [2019-12-27 05:22:00,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:22:00,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:22:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:00,682 INFO L225 Difference]: With dead ends: 126434 [2019-12-27 05:22:00,682 INFO L226 Difference]: Without dead ends: 114748 [2019-12-27 05:22:00,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-27 05:22:01,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114748 states. [2019-12-27 05:22:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114748 to 36303. [2019-12-27 05:22:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36303 states. [2019-12-27 05:22:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36303 states to 36303 states and 116611 transitions. [2019-12-27 05:22:02,292 INFO L78 Accepts]: Start accepts. Automaton has 36303 states and 116611 transitions. Word has length 66 [2019-12-27 05:22:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:02,292 INFO L462 AbstractCegarLoop]: Abstraction has 36303 states and 116611 transitions. [2019-12-27 05:22:02,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 36303 states and 116611 transitions. [2019-12-27 05:22:02,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:02,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:02,330 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 05:22:02,330 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 05:22:02,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:02,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1510431144, now seen corresponding path program 5 times [2019-12-27 05:22:02,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:02,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561867735] [2019-12-27 05:22:02,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:02,453 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 05:22:02,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561867735] [2019-12-27 05:22:02,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:02,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:02,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86370998] [2019-12-27 05:22:02,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:22:02,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:02,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:22:02,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:22:02,456 INFO L87 Difference]: Start difference. First operand 36303 states and 116611 transitions. Second operand 9 states. [2019-12-27 05:22:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:04,297 INFO L93 Difference]: Finished difference Result 142418 states and 447631 transitions. [2019-12-27 05:22:04,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 05:22:04,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:22:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:04,517 INFO L225 Difference]: With dead ends: 142418 [2019-12-27 05:22:04,518 INFO L226 Difference]: Without dead ends: 119348 [2019-12-27 05:22:04,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-27 05:22:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119348 states. [2019-12-27 05:22:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119348 to 38548. [2019-12-27 05:22:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38548 states. [2019-12-27 05:22:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38548 states to 38548 states and 124737 transitions. [2019-12-27 05:22:06,206 INFO L78 Accepts]: Start accepts. Automaton has 38548 states and 124737 transitions. Word has length 66 [2019-12-27 05:22:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:06,206 INFO L462 AbstractCegarLoop]: Abstraction has 38548 states and 124737 transitions. [2019-12-27 05:22:06,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 38548 states and 124737 transitions. [2019-12-27 05:22:06,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:22:06,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:06,249 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 05:22:06,249 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 05:22:06,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:06,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1869416178, now seen corresponding path program 1 times [2019-12-27 05:22:06,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:06,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218517353] [2019-12-27 05:22:06,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:06,316 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 05:22:06,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218517353] [2019-12-27 05:22:06,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:06,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:22:06,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957689644] [2019-12-27 05:22:06,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:22:06,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:06,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:22:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:22:06,318 INFO L87 Difference]: Start difference. First operand 38548 states and 124737 transitions. Second operand 3 states. [2019-12-27 05:22:06,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:06,461 INFO L93 Difference]: Finished difference Result 30561 states and 97348 transitions. [2019-12-27 05:22:06,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:22:06,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:22:06,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:06,522 INFO L225 Difference]: With dead ends: 30561 [2019-12-27 05:22:06,523 INFO L226 Difference]: Without dead ends: 30561 [2019-12-27 05:22:06,523 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 05:22:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30561 states. [2019-12-27 05:22:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30561 to 28023. [2019-12-27 05:22:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28023 states. [2019-12-27 05:22:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28023 states to 28023 states and 89084 transitions. [2019-12-27 05:22:06,998 INFO L78 Accepts]: Start accepts. Automaton has 28023 states and 89084 transitions. Word has length 66 [2019-12-27 05:22:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:06,998 INFO L462 AbstractCegarLoop]: Abstraction has 28023 states and 89084 transitions. [2019-12-27 05:22:06,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:22:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 28023 states and 89084 transitions. [2019-12-27 05:22:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:07,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:07,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, 1, 1, 1, 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 05:22:07,027 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:07,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1833062279, now seen corresponding path program 1 times [2019-12-27 05:22:07,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:07,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642577597] [2019-12-27 05:22:07,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:07,127 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 05:22:07,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642577597] [2019-12-27 05:22:07,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:07,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:07,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340483560] [2019-12-27 05:22:07,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:22:07,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:07,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:22:07,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:22:07,129 INFO L87 Difference]: Start difference. First operand 28023 states and 89084 transitions. Second operand 9 states. [2019-12-27 05:22:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:08,752 INFO L93 Difference]: Finished difference Result 51324 states and 161649 transitions. [2019-12-27 05:22:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:22:08,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 05:22:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:08,814 INFO L225 Difference]: With dead ends: 51324 [2019-12-27 05:22:08,814 INFO L226 Difference]: Without dead ends: 42706 [2019-12-27 05:22:08,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:22:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42706 states. [2019-12-27 05:22:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42706 to 28818. [2019-12-27 05:22:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28818 states. [2019-12-27 05:22:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28818 states to 28818 states and 91068 transitions. [2019-12-27 05:22:09,395 INFO L78 Accepts]: Start accepts. Automaton has 28818 states and 91068 transitions. Word has length 67 [2019-12-27 05:22:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:09,396 INFO L462 AbstractCegarLoop]: Abstraction has 28818 states and 91068 transitions. [2019-12-27 05:22:09,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:22:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 28818 states and 91068 transitions. [2019-12-27 05:22:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:09,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:09,430 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 05:22:09,430 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:09,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1111850191, now seen corresponding path program 2 times [2019-12-27 05:22:09,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:09,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803842623] [2019-12-27 05:22:09,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:09,499 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 05:22:09,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803842623] [2019-12-27 05:22:09,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:09,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:22:09,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72021522] [2019-12-27 05:22:09,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:22:09,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:22:09,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:22:09,500 INFO L87 Difference]: Start difference. First operand 28818 states and 91068 transitions. Second operand 4 states. [2019-12-27 05:22:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:09,662 INFO L93 Difference]: Finished difference Result 28818 states and 90844 transitions. [2019-12-27 05:22:09,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:22:09,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 05:22:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:09,707 INFO L225 Difference]: With dead ends: 28818 [2019-12-27 05:22:09,707 INFO L226 Difference]: Without dead ends: 28818 [2019-12-27 05:22:09,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 05:22:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28818 states. [2019-12-27 05:22:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28818 to 23876. [2019-12-27 05:22:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23876 states. [2019-12-27 05:22:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23876 states to 23876 states and 74879 transitions. [2019-12-27 05:22:10,164 INFO L78 Accepts]: Start accepts. Automaton has 23876 states and 74879 transitions. Word has length 67 [2019-12-27 05:22:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:10,164 INFO L462 AbstractCegarLoop]: Abstraction has 23876 states and 74879 transitions. [2019-12-27 05:22:10,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:22:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23876 states and 74879 transitions. [2019-12-27 05:22:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:10,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:10,190 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 05:22:10,190 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:10,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1228876713, now seen corresponding path program 1 times [2019-12-27 05:22:10,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:10,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354333083] [2019-12-27 05:22:10,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:10,367 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 05:22:10,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354333083] [2019-12-27 05:22:10,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:10,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:10,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257085689] [2019-12-27 05:22:10,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:22:10,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:10,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:22:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:22:10,370 INFO L87 Difference]: Start difference. First operand 23876 states and 74879 transitions. Second operand 10 states. [2019-12-27 05:22:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:11,470 INFO L93 Difference]: Finished difference Result 46390 states and 144713 transitions. [2019-12-27 05:22:11,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:22:11,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 05:22:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:11,534 INFO L225 Difference]: With dead ends: 46390 [2019-12-27 05:22:11,535 INFO L226 Difference]: Without dead ends: 44475 [2019-12-27 05:22:11,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:22:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44475 states. [2019-12-27 05:22:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44475 to 27381. [2019-12-27 05:22:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27381 states. [2019-12-27 05:22:12,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27381 states to 27381 states and 85851 transitions. [2019-12-27 05:22:12,270 INFO L78 Accepts]: Start accepts. Automaton has 27381 states and 85851 transitions. Word has length 67 [2019-12-27 05:22:12,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:12,270 INFO L462 AbstractCegarLoop]: Abstraction has 27381 states and 85851 transitions. [2019-12-27 05:22:12,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:22:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 27381 states and 85851 transitions. [2019-12-27 05:22:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:12,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:12,300 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 05:22:12,300 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:12,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1322343339, now seen corresponding path program 2 times [2019-12-27 05:22:12,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:12,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163328002] [2019-12-27 05:22:12,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:12,456 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 05:22:12,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163328002] [2019-12-27 05:22:12,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:12,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:22:12,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652772045] [2019-12-27 05:22:12,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:22:12,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:12,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:22:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:22:12,458 INFO L87 Difference]: Start difference. First operand 27381 states and 85851 transitions. Second operand 10 states. [2019-12-27 05:22:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:13,575 INFO L93 Difference]: Finished difference Result 45108 states and 140350 transitions. [2019-12-27 05:22:13,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 05:22:13,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 05:22:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:13,635 INFO L225 Difference]: With dead ends: 45108 [2019-12-27 05:22:13,636 INFO L226 Difference]: Without dead ends: 38197 [2019-12-27 05:22:13,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 05:22:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38197 states. [2019-12-27 05:22:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38197 to 23343. [2019-12-27 05:22:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23343 states. [2019-12-27 05:22:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23343 states to 23343 states and 72983 transitions. [2019-12-27 05:22:14,133 INFO L78 Accepts]: Start accepts. Automaton has 23343 states and 72983 transitions. Word has length 67 [2019-12-27 05:22:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:14,133 INFO L462 AbstractCegarLoop]: Abstraction has 23343 states and 72983 transitions. [2019-12-27 05:22:14,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:22:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 23343 states and 72983 transitions. [2019-12-27 05:22:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:14,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:14,157 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 05:22:14,157 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:14,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:14,157 INFO L82 PathProgramCache]: Analyzing trace with hash -163030355, now seen corresponding path program 3 times [2019-12-27 05:22:14,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:14,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320961689] [2019-12-27 05:22:14,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:14,317 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 05:22:14,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320961689] [2019-12-27 05:22:14,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:14,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:22:14,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376438891] [2019-12-27 05:22:14,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:22:14,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:14,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:22:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:22:14,319 INFO L87 Difference]: Start difference. First operand 23343 states and 72983 transitions. Second operand 11 states. [2019-12-27 05:22:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:15,326 INFO L93 Difference]: Finished difference Result 40953 states and 127325 transitions. [2019-12-27 05:22:15,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:22:15,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:22:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:15,379 INFO L225 Difference]: With dead ends: 40953 [2019-12-27 05:22:15,379 INFO L226 Difference]: Without dead ends: 39934 [2019-12-27 05:22:15,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:22:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39934 states. [2019-12-27 05:22:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39934 to 25853. [2019-12-27 05:22:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25853 states. [2019-12-27 05:22:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25853 states to 25853 states and 80834 transitions. [2019-12-27 05:22:16,043 INFO L78 Accepts]: Start accepts. Automaton has 25853 states and 80834 transitions. Word has length 67 [2019-12-27 05:22:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:16,043 INFO L462 AbstractCegarLoop]: Abstraction has 25853 states and 80834 transitions. [2019-12-27 05:22:16,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:22:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 25853 states and 80834 transitions. [2019-12-27 05:22:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:16,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:16,069 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 05:22:16,069 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1906777599, now seen corresponding path program 4 times [2019-12-27 05:22:16,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:16,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460225366] [2019-12-27 05:22:16,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:16,214 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 05:22:16,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460225366] [2019-12-27 05:22:16,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:16,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:22:16,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67421391] [2019-12-27 05:22:16,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:22:16,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:22:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:22:16,216 INFO L87 Difference]: Start difference. First operand 25853 states and 80834 transitions. Second operand 11 states. [2019-12-27 05:22:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:17,133 INFO L93 Difference]: Finished difference Result 40530 states and 125593 transitions. [2019-12-27 05:22:17,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:22:17,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 05:22:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:17,184 INFO L225 Difference]: With dead ends: 40530 [2019-12-27 05:22:17,184 INFO L226 Difference]: Without dead ends: 37232 [2019-12-27 05:22:17,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:22:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37232 states. [2019-12-27 05:22:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37232 to 22900. [2019-12-27 05:22:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22900 states. [2019-12-27 05:22:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22900 states to 22900 states and 71486 transitions. [2019-12-27 05:22:17,641 INFO L78 Accepts]: Start accepts. Automaton has 22900 states and 71486 transitions. Word has length 67 [2019-12-27 05:22:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:17,641 INFO L462 AbstractCegarLoop]: Abstraction has 22900 states and 71486 transitions. [2019-12-27 05:22:17,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:22:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 22900 states and 71486 transitions. [2019-12-27 05:22:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:17,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:17,668 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 05:22:17,668 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:17,669 INFO L82 PathProgramCache]: Analyzing trace with hash 869682389, now seen corresponding path program 5 times [2019-12-27 05:22:17,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:17,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813533788] [2019-12-27 05:22:17,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:22:18,168 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 05:22:18,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813533788] [2019-12-27 05:22:18,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:22:18,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 05:22:18,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89154178] [2019-12-27 05:22:18,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 05:22:18,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:22:18,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 05:22:18,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 05:22:18,179 INFO L87 Difference]: Start difference. First operand 22900 states and 71486 transitions. Second operand 16 states. [2019-12-27 05:22:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:22:21,036 INFO L93 Difference]: Finished difference Result 30003 states and 92538 transitions. [2019-12-27 05:22:21,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 05:22:21,037 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 05:22:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:22:21,084 INFO L225 Difference]: With dead ends: 30003 [2019-12-27 05:22:21,084 INFO L226 Difference]: Without dead ends: 29782 [2019-12-27 05:22:21,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=294, Invalid=1266, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 05:22:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29782 states. [2019-12-27 05:22:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29782 to 22724. [2019-12-27 05:22:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22724 states. [2019-12-27 05:22:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22724 states to 22724 states and 71014 transitions. [2019-12-27 05:22:21,676 INFO L78 Accepts]: Start accepts. Automaton has 22724 states and 71014 transitions. Word has length 67 [2019-12-27 05:22:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:22:21,676 INFO L462 AbstractCegarLoop]: Abstraction has 22724 states and 71014 transitions. [2019-12-27 05:22:21,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 05:22:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 22724 states and 71014 transitions. [2019-12-27 05:22:21,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:22:21,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:22:21,704 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 05:22:21,704 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:22:21,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:22:21,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1815001603, now seen corresponding path program 6 times [2019-12-27 05:22:21,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:22:21,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275073724] [2019-12-27 05:22:21,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:22:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:22:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:22:21,816 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:22:21,816 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:22:21,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= 0 v_~a$w_buff1_used~0_72) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~a$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_14) (= v_~a$r_buff0_thd3~0_77 0) (= v_~x~0_10 0) (= v_~a$r_buff0_thd1~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t257~0.base_25|)) (= 0 v_~a$w_buff0_used~0_113) (= v_~a$flush_delayed~0_13 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t257~0.base_25|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~a$w_buff1~0_26) (= v_~a$mem_tmp~0_10 0) (= v_~main$tmp_guard1~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t257~0.base_25| 1) |v_#valid_55|) (= 0 v_~y~0_8) (= 0 v_~a$r_buff1_thd0~0_22) (= v_~a$r_buff0_thd2~0_21 0) (= |v_#NULL.offset_4| 0) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= 0 v_~z~0_8) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t257~0.base_25| 4)) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~a$r_buff1_thd1~0_17) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_25| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t257~0.base_25|) |v_ULTIMATE.start_main_~#t257~0.offset_19| 0))) (= v_~main$tmp_guard0~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t257~0.offset_19|) (= v_~a$r_buff0_thd0~0_21 0) (= v_~a~0_27 0) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_17|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, 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|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_21, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~a~0=v_~a~0_27, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_21|, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t257~0.offset=|v_ULTIMATE.start_main_~#t257~0.offset_19|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~a$w_buff1~0=v_~a$w_buff1~0_26, ~y~0=v_~y~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ULTIMATE.start_main_~#t257~0.base=|v_ULTIMATE.start_main_~#t257~0.base_25|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_21|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_8, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t259~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t257~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t257~0.base, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t258~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_~#t259~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 05:22:21,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= v_~a$w_buff0_used~0_92 1) (= 0 (mod v_~a$w_buff1_used~0_57 256)) (= v_~a$w_buff0_used~0_93 v_~a$w_buff1_used~0_57) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_16 v_~a$w_buff1~0_18) (= 1 v_~a$w_buff0~0_15) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_18, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_15, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_92, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:22:21,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L837-1-->L839: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t258~0.base_12|) |v_ULTIMATE.start_main_~#t258~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t258~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t258~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t258~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t258~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t258~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t258~0.base=|v_ULTIMATE.start_main_~#t258~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t258~0.offset=|v_ULTIMATE.start_main_~#t258~0.offset_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t258~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t258~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:22:21,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L839-1-->L841: Formula: (and (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t259~0.offset_10| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t259~0.base_12|) |v_ULTIMATE.start_main_~#t259~0.offset_10| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t259~0.base_12|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t259~0.base_12| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t259~0.base_12|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t259~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t259~0.base=|v_ULTIMATE.start_main_~#t259~0.base_12|, ULTIMATE.start_main_~#t259~0.offset=|v_ULTIMATE.start_main_~#t259~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t259~0.base, ULTIMATE.start_main_~#t259~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 05:22:21,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In1455773317 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd2~0_In1455773317 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1455773317| ~a~0_In1455773317) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1455773317| ~a$w_buff1~0_In1455773317) (not .cse1)))) InVars {~a~0=~a~0_In1455773317, ~a$w_buff1~0=~a$w_buff1~0_In1455773317, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1455773317, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1455773317} OutVars{~a~0=~a~0_In1455773317, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1455773317|, ~a$w_buff1~0=~a$w_buff1~0_In1455773317, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1455773317, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1455773317} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:22:21,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= v_~a~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_18, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:22:21,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2108936903 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-2108936903 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-2108936903|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2108936903 |P1Thread1of1ForFork2_#t~ite11_Out-2108936903|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2108936903, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2108936903} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2108936903, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2108936903, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-2108936903|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:22:21,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2039633159 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-2039633159 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-2039633159| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-2039633159| ~a$w_buff0_used~0_In-2039633159)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2039633159, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2039633159} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-2039633159|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2039633159, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2039633159} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:22:21,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In1220318898 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In1220318898 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1220318898 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1220318898 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1220318898| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out1220318898| ~a$w_buff1_used~0_In1220318898) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1220318898, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1220318898, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1220318898, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1220318898} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1220318898|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1220318898, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1220318898, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1220318898, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1220318898} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:22:21,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-653413005 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-653413005 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~a$r_buff0_thd1~0_Out-653413005)) (and (= ~a$r_buff0_thd1~0_In-653413005 ~a$r_buff0_thd1~0_Out-653413005) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-653413005, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-653413005} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-653413005|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-653413005, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-653413005} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:22:21,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In2005880829 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2005880829 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2005880829 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In2005880829 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In2005880829 |P0Thread1of1ForFork1_#t~ite8_Out2005880829|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out2005880829|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2005880829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2005880829, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2005880829, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2005880829} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out2005880829|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2005880829, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2005880829, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2005880829, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2005880829} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:22:21,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L756-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:22:21,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1663722702 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out1663722702| ~a$w_buff0~0_In1663722702) (= |P2Thread1of1ForFork0_#t~ite20_In1663722702| |P2Thread1of1ForFork0_#t~ite20_Out1663722702|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1663722702 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1663722702 256) 0)) (= (mod ~a$w_buff0_used~0_In1663722702 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In1663722702 256) 0)))) (= ~a$w_buff0~0_In1663722702 |P2Thread1of1ForFork0_#t~ite20_Out1663722702|) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out1663722702| |P2Thread1of1ForFork0_#t~ite20_Out1663722702|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1663722702, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1663722702, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1663722702, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1663722702, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1663722702, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1663722702|, ~weak$$choice2~0=~weak$$choice2~0_In1663722702} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1663722702|, ~a$w_buff0~0=~a$w_buff0~0_In1663722702, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1663722702, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1663722702, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1663722702, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1663722702|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1663722702, ~weak$$choice2~0=~weak$$choice2~0_In1663722702} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:22:21,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L805-->L805-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-486006039 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-486006039 256)))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-486006039 256)) .cse0) (= (mod ~a$w_buff0_used~0_In-486006039 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In-486006039 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out-486006039| ~a$w_buff0_used~0_In-486006039) (= |P2Thread1of1ForFork0_#t~ite26_Out-486006039| |P2Thread1of1ForFork0_#t~ite27_Out-486006039|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out-486006039| ~a$w_buff0_used~0_In-486006039) (= |P2Thread1of1ForFork0_#t~ite26_In-486006039| |P2Thread1of1ForFork0_#t~ite26_Out-486006039|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-486006039|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-486006039, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-486006039, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-486006039, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-486006039, ~weak$$choice2~0=~weak$$choice2~0_In-486006039} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-486006039|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-486006039|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-486006039, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-486006039, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-486006039, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-486006039, ~weak$$choice2~0=~weak$$choice2~0_In-486006039} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:22:21,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_47 v_~a$r_buff0_thd3~0_46)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_46, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:22:21,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (= v_~a~0_17 v_~a$mem_tmp~0_4) (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_17, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:22:21,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In817294851 256))) (.cse0 (= (mod ~a$r_buff1_thd3~0_In817294851 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out817294851| |P2Thread1of1ForFork0_#t~ite38_Out817294851|))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out817294851| ~a$w_buff1~0_In817294851) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out817294851| ~a~0_In817294851) (or .cse2 .cse0) .cse1))) InVars {~a~0=~a~0_In817294851, ~a$w_buff1~0=~a$w_buff1~0_In817294851, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In817294851, ~a$w_buff1_used~0=~a$w_buff1_used~0_In817294851} OutVars{~a~0=~a~0_In817294851, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out817294851|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out817294851|, ~a$w_buff1~0=~a$w_buff1~0_In817294851, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In817294851, ~a$w_buff1_used~0=~a$w_buff1_used~0_In817294851} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:22:21,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-9248027 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-9248027 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-9248027| ~a$w_buff0_used~0_In-9248027)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-9248027| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-9248027, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-9248027} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-9248027|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-9248027, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-9248027} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:22:21,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-210349861 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-210349861 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-210349861 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-210349861 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-210349861| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-210349861| ~a$w_buff1_used~0_In-210349861) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-210349861, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-210349861, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-210349861, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-210349861} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-210349861, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-210349861, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-210349861, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-210349861, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-210349861|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:22:21,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd2~0_In1760242069 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1760242069 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1760242069 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1760242069 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out1760242069| 0)) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In1760242069 |P1Thread1of1ForFork2_#t~ite12_Out1760242069|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1760242069, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1760242069, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1760242069, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1760242069} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1760242069, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1760242069, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1760242069, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1760242069|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1760242069} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:22:21,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1055330929 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1055330929 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1055330929| 0)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In1055330929 |P1Thread1of1ForFork2_#t~ite13_Out1055330929|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1055330929, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1055330929} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1055330929, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1055330929, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1055330929|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:22:21,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In-1120882078 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1120882078 256))) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1120882078 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1120882078 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-1120882078| ~a$r_buff1_thd2~0_In-1120882078) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1120882078| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1120882078, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1120882078, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1120882078, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1120882078} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1120882078, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1120882078, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1120882078, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1120882078, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1120882078|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:22:21,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:22:21,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-373355775 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-373355775 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-373355775| ~a$r_buff0_thd3~0_In-373355775)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-373355775| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-373355775, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-373355775} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-373355775, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-373355775, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-373355775|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:22:21,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1401818109 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-1401818109 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1401818109 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1401818109 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-1401818109 |P2Thread1of1ForFork0_#t~ite43_Out-1401818109|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1401818109|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1401818109, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1401818109, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1401818109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1401818109} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1401818109|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1401818109, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1401818109, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1401818109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1401818109} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:22:21,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_45 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:22:21,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:22:21,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1773809150 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-1773809150 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1773809150| ~a~0_In-1773809150)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1773809150| ~a$w_buff1~0_In-1773809150) (not .cse1)))) InVars {~a~0=~a~0_In-1773809150, ~a$w_buff1~0=~a$w_buff1~0_In-1773809150, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1773809150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1773809150} OutVars{~a~0=~a~0_In-1773809150, ~a$w_buff1~0=~a$w_buff1~0_In-1773809150, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1773809150|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1773809150, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1773809150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 05:22:21,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_19 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~a~0=v_~a~0_19, 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[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:22:21,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In711278174 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In711278174 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out711278174| ~a$w_buff0_used~0_In711278174)) (and (= |ULTIMATE.start_main_#t~ite49_Out711278174| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In711278174, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In711278174} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In711278174, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out711278174|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In711278174} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:22:21,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1095778990 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1095778990 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1095778990 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-1095778990 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1095778990 |ULTIMATE.start_main_#t~ite50_Out-1095778990|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out-1095778990| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1095778990, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1095778990, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1095778990, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1095778990} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1095778990|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1095778990, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1095778990, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1095778990, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1095778990} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:22:21,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1052610843 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1052610843 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1052610843|)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd0~0_In-1052610843 |ULTIMATE.start_main_#t~ite51_Out-1052610843|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1052610843, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1052610843} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1052610843|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1052610843, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1052610843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:22:21,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1910121537 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1910121537 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1910121537 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1910121537 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1910121537| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out1910121537| ~a$r_buff1_thd0~0_In1910121537) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1910121537, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1910121537, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1910121537, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1910121537} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1910121537|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1910121537, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1910121537, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1910121537, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1910121537} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:22:21,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p0_EAX~0_9 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite52_14| v_~a$r_buff1_thd0~0_14) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_7 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:22:21,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:22:21 BasicIcfg [2019-12-27 05:22:21,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:22:21,955 INFO L168 Benchmark]: Toolchain (without parser) took 141225.34 ms. Allocated memory was 136.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 731.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:21,955 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 136.8 MB. Free memory is still 118.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 05:22:21,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.44 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 98.4 MB in the beginning and 154.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:21,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.40 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:21,956 INFO L168 Benchmark]: Boogie Preprocessor took 51.11 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:21,957 INFO L168 Benchmark]: RCFGBuilder took 811.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 98.5 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:21,957 INFO L168 Benchmark]: TraceAbstraction took 139505.96 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 666.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:22:21,959 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47 ms. Allocated memory is still 136.8 MB. Free memory is still 118.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.44 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 98.4 MB in the beginning and 154.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.40 ms. Allocated memory is still 201.3 MB. Free memory was 154.4 MB in the beginning and 151.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.11 ms. Allocated memory is still 201.3 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.47 ms. Allocated memory is still 201.3 MB. Free memory was 149.4 MB in the beginning and 98.5 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139505.96 ms. Allocated memory was 201.3 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 98.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 666.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 179 ProgramPointsBefore, 97 ProgramPointsAfterwards, 216 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 30 ChoiceCompositions, 6465 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 95714 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t257, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t258, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) 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, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) 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=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 139.1s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 38.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9438 SDtfs, 14645 SDslu, 34811 SDs, 0 SdLazy, 15533 SolverSat, 745 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 50 SyntacticMatches, 16 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2073 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184385occurred 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: 64.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 641748 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1770 NumberOfCodeBlocks, 1770 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1669 ConstructedInterpolants, 0 QuantifiedInterpolants, 345917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...