/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:09:25,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:09:25,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:09:25,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:09:25,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:09:25,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:09:25,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:09:25,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:09:25,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:09:25,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:09:25,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:09:25,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:09:25,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:09:25,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:09:25,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:09:25,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:09:25,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:09:25,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:09:25,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:09:25,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:09:25,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:09:25,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:09:25,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:09:25,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:09:25,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:09:25,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:09:25,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:09:25,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:09:25,551 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:09:25,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:09:25,552 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:09:25,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:09:25,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:09:25,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:09:25,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:09:25,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:09:25,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:09:25,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:09:25,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:09:25,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:09:25,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:09:25,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:09:25,580 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:09:25,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:09:25,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:09:25,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:09:25,583 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:09:25,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:09:25,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:09:25,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:09:25,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:09:25,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:09:25,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:09:25,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:09:25,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:09:25,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:09:25,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:09:25,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:09:25,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:09:25,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:09:25,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:09:25,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:09:25,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:09:25,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:09:25,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:09:25,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:09:25,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:09:25,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:09:25,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:09:25,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:09:25,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:09:25,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:09:25,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:09:25,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:09:25,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:09:25,885 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:09:25,886 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-18 16:09:25,960 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb479a8d/9c244c09294e469ea09ca5aa4f89ef47/FLAGccaf49c89 [2019-12-18 16:09:26,536 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:09:26,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-18 16:09:26,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb479a8d/9c244c09294e469ea09ca5aa4f89ef47/FLAGccaf49c89 [2019-12-18 16:09:26,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb479a8d/9c244c09294e469ea09ca5aa4f89ef47 [2019-12-18 16:09:26,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:09:26,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:09:26,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:09:26,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:09:26,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:09:26,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:09:26" (1/1) ... [2019-12-18 16:09:26,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45be7259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:26, skipping insertion in model container [2019-12-18 16:09:26,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:09:26" (1/1) ... [2019-12-18 16:09:26,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:09:26,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:09:27,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:09:27,402 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:09:27,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:09:27,575 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:09:27,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27 WrapperNode [2019-12-18 16:09:27,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:09:27,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:09:27,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:09:27,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:09:27,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:09:27,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:09:27,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:09:27,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:09:27,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... [2019-12-18 16:09:27,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:09:27,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:09:27,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:09:27,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:09:27,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:09:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:09:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:09:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:09:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:09:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:09:27,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:09:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:09:27,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:09:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:09:27,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:09:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:09:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:09:27,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:09:27,766 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:09:28,576 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:09:28,577 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:09:28,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:09:28 BoogieIcfgContainer [2019-12-18 16:09:28,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:09:28,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:09:28,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:09:28,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:09:28,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:09:26" (1/3) ... [2019-12-18 16:09:28,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191c7d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:09:28, skipping insertion in model container [2019-12-18 16:09:28,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:09:27" (2/3) ... [2019-12-18 16:09:28,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191c7d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:09:28, skipping insertion in model container [2019-12-18 16:09:28,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:09:28" (3/3) ... [2019-12-18 16:09:28,587 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2019-12-18 16:09:28,598 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:09:28,598 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:09:28,606 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:09:28,607 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:09:28,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,649 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,651 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,653 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,654 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,675 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,683 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,713 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,722 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:09:28,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:09:28,763 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:09:28,763 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:09:28,764 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:09:28,764 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:09:28,764 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:09:28,764 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:09:28,764 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:09:28,764 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:09:28,782 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 16:09:28,785 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 16:09:28,877 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 16:09:28,877 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:09:28,900 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:09:28,934 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 16:09:28,982 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 16:09:28,983 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:09:28,991 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:09:29,012 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:09:29,014 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:09:34,621 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 16:09:34,754 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 16:09:34,792 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-18 16:09:34,792 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 16:09:34,796 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 16:09:53,602 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-18 16:09:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-18 16:09:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:09:53,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:09:53,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:09:53,610 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-18 16:09:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:09:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-18 16:09:53,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:09:53,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053921038] [2019-12-18 16:09:53,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:09:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:09:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:09:53,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053921038] [2019-12-18 16:09:53,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:09:53,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:09:53,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229867429] [2019-12-18 16:09:53,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:09:53,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:09:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:09:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:09:53,867 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-18 16:09:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:09:57,548 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-18 16:09:57,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:09:57,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:09:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:09:58,151 INFO L225 Difference]: With dead ends: 109312 [2019-12-18 16:09:58,152 INFO L226 Difference]: Without dead ends: 102592 [2019-12-18 16:09:58,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-18 16:10:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-18 16:10:05,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-18 16:10:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-18 16:10:05,958 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-18 16:10:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:05,958 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-18 16:10:05,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-18 16:10:05,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:10:05,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:05,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:05,962 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-18 16:10:05,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:05,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-18 16:10:05,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:05,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199794297] [2019-12-18 16:10:05,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:06,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199794297] [2019-12-18 16:10:06,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:06,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:10:06,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762353056] [2019-12-18 16:10:06,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:10:06,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:10:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:10:06,074 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-18 16:10:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:10,873 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-18 16:10:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:10:10,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:10:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:11,514 INFO L225 Difference]: With dead ends: 159508 [2019-12-18 16:10:11,515 INFO L226 Difference]: Without dead ends: 159459 [2019-12-18 16:10:11,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:10:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-18 16:10:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-18 16:10:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-18 16:10:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-18 16:10:28,918 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-18 16:10:28,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:28,918 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-18 16:10:28,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:10:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-18 16:10:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:10:28,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:28,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:28,929 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-18 16:10:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-18 16:10:28,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:28,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717330852] [2019-12-18 16:10:28,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:29,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717330852] [2019-12-18 16:10:29,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:29,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:10:29,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738177442] [2019-12-18 16:10:29,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:10:29,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:29,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:10:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:29,032 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-18 16:10:29,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:29,150 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-18 16:10:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:10:29,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:10:29,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:29,204 INFO L225 Difference]: With dead ends: 32284 [2019-12-18 16:10:29,205 INFO L226 Difference]: Without dead ends: 32284 [2019-12-18 16:10:29,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-18 16:10:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-18 16:10:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-18 16:10:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-18 16:10:29,785 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-18 16:10:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:29,786 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-18 16:10:29,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-18 16:10:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:10:29,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:29,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:29,790 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-18 16:10:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-18 16:10:29,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:29,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556387864] [2019-12-18 16:10:29,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:29,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556387864] [2019-12-18 16:10:29,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:29,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:10:29,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578593054] [2019-12-18 16:10:29,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:10:29,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:29,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:10:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:10:29,878 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-18 16:10:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:30,206 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-18 16:10:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:10:30,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 16:10:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:30,271 INFO L225 Difference]: With dead ends: 40215 [2019-12-18 16:10:30,272 INFO L226 Difference]: Without dead ends: 40215 [2019-12-18 16:10:30,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:10:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-18 16:10:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-18 16:10:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-18 16:10:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-18 16:10:31,777 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-18 16:10:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:31,778 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-18 16:10:31,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:10:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-18 16:10:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:10:31,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:31,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:31,787 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-18 16:10:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-18 16:10:31,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:31,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769516895] [2019-12-18 16:10:31,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:31,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769516895] [2019-12-18 16:10:31,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:31,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:10:31,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851322461] [2019-12-18 16:10:31,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:10:31,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:10:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:10:31,906 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-18 16:10:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:32,527 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-18 16:10:32,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:10:32,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:10:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:32,605 INFO L225 Difference]: With dead ends: 46566 [2019-12-18 16:10:32,605 INFO L226 Difference]: Without dead ends: 46559 [2019-12-18 16:10:32,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:10:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-18 16:10:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-18 16:10:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-18 16:10:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-18 16:10:33,893 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-18 16:10:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:33,894 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-18 16:10:33,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:10:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-18 16:10:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:10:33,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:33,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:33,905 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-18 16:10:33,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:33,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-18 16:10:33,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:33,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780308229] [2019-12-18 16:10:33,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:33,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780308229] [2019-12-18 16:10:33,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:33,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:10:33,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385244174] [2019-12-18 16:10:33,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:10:33,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:33,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:10:33,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:10:33,993 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-18 16:10:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:34,050 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-18 16:10:34,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:10:34,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:10:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:34,070 INFO L225 Difference]: With dead ends: 14498 [2019-12-18 16:10:34,070 INFO L226 Difference]: Without dead ends: 14498 [2019-12-18 16:10:34,070 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-18 16:10:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-18 16:10:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-18 16:10:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-18 16:10:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-18 16:10:34,279 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-18 16:10:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:34,279 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-18 16:10:34,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:10:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-18 16:10:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:10:34,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:34,291 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-18 16:10:34,291 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-18 16:10:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-18 16:10:34,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:34,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092467797] [2019-12-18 16:10:34,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:34,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092467797] [2019-12-18 16:10:34,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:34,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:10:34,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338178171] [2019-12-18 16:10:34,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:10:34,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:34,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:10:34,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:10:34,389 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-18 16:10:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:35,138 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-18 16:10:35,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:10:35,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 16:10:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:35,205 INFO L225 Difference]: With dead ends: 39008 [2019-12-18 16:10:35,205 INFO L226 Difference]: Without dead ends: 39008 [2019-12-18 16:10:35,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:10:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-18 16:10:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-18 16:10:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-18 16:10:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-18 16:10:35,680 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-18 16:10:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:35,681 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-18 16:10:35,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:10:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-18 16:10:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:10:35,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:35,699 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] [2019-12-18 16:10:35,699 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-18 16:10:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-18 16:10:35,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:35,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069476880] [2019-12-18 16:10:35,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:35,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069476880] [2019-12-18 16:10:35,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:35,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:10:35,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256572413] [2019-12-18 16:10:35,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:10:35,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:35,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:10:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:10:35,780 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-18 16:10:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:36,883 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-18 16:10:36,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:10:36,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 16:10:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:36,949 INFO L225 Difference]: With dead ends: 43584 [2019-12-18 16:10:36,949 INFO L226 Difference]: Without dead ends: 43584 [2019-12-18 16:10:36,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:10:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-18 16:10:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-18 16:10:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-18 16:10:37,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-18 16:10:37,426 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-18 16:10:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:37,426 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-18 16:10:37,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:10:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-18 16:10:37,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:10:37,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:37,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:37,451 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-18 16:10:37,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:37,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-18 16:10:37,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:37,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067575533] [2019-12-18 16:10:37,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:37,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-18 16:10:37,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067575533] [2019-12-18 16:10:37,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:37,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:10:37,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97757601] [2019-12-18 16:10:37,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:10:37,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:37,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:10:37,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:10:37,551 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-18 16:10:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:38,947 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-18 16:10:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:10:38,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 16:10:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:39,030 INFO L225 Difference]: With dead ends: 51613 [2019-12-18 16:10:39,031 INFO L226 Difference]: Without dead ends: 51613 [2019-12-18 16:10:39,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:10:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-18 16:10:39,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-18 16:10:39,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-18 16:10:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-18 16:10:39,937 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-18 16:10:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:39,938 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-18 16:10:39,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:10:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-18 16:10:39,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:10:39,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:39,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:39,964 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-18 16:10:39,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:39,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-18 16:10:39,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:39,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213651626] [2019-12-18 16:10:39,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:40,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213651626] [2019-12-18 16:10:40,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:40,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:10:40,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444371290] [2019-12-18 16:10:40,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:10:40,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:10:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:10:40,067 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-18 16:10:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:42,263 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-18 16:10:42,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:10:42,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 16:10:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:42,397 INFO L225 Difference]: With dead ends: 79921 [2019-12-18 16:10:42,397 INFO L226 Difference]: Without dead ends: 79921 [2019-12-18 16:10:42,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:10:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-18 16:10:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-18 16:10:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-18 16:10:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-18 16:10:43,664 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-18 16:10:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:43,664 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-18 16:10:43,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:10:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-18 16:10:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:10:43,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:43,691 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] [2019-12-18 16:10:43,691 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-18 16:10:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:43,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-18 16:10:43,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:43,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55823138] [2019-12-18 16:10:43,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:43,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55823138] [2019-12-18 16:10:43,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:43,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:10:43,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461658959] [2019-12-18 16:10:43,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:10:43,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:43,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:10:43,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:10:43,815 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-18 16:10:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:45,260 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-18 16:10:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:10:45,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 16:10:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:45,331 INFO L225 Difference]: With dead ends: 45327 [2019-12-18 16:10:45,331 INFO L226 Difference]: Without dead ends: 45327 [2019-12-18 16:10:45,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:10:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-18 16:10:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-18 16:10:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-18 16:10:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-18 16:10:45,822 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-18 16:10:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:45,822 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-18 16:10:45,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:10:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-18 16:10:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 16:10:45,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:45,846 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] [2019-12-18 16:10:45,846 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-18 16:10:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:45,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-18 16:10:45,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:45,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644790218] [2019-12-18 16:10:45,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:46,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644790218] [2019-12-18 16:10:46,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:46,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:10:46,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347196718] [2019-12-18 16:10:46,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:10:46,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:46,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:10:46,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:10:46,016 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 9 states. [2019-12-18 16:10:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:48,912 INFO L93 Difference]: Finished difference Result 57708 states and 172700 transitions. [2019-12-18 16:10:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:10:48,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 16:10:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:49,057 INFO L225 Difference]: With dead ends: 57708 [2019-12-18 16:10:49,057 INFO L226 Difference]: Without dead ends: 57708 [2019-12-18 16:10:49,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2019-12-18 16:10:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57708 states. [2019-12-18 16:10:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57708 to 19933. [2019-12-18 16:10:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19933 states. [2019-12-18 16:10:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19933 states to 19933 states and 61986 transitions. [2019-12-18 16:10:49,677 INFO L78 Accepts]: Start accepts. Automaton has 19933 states and 61986 transitions. Word has length 34 [2019-12-18 16:10:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:49,677 INFO L462 AbstractCegarLoop]: Abstraction has 19933 states and 61986 transitions. [2019-12-18 16:10:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:10:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 19933 states and 61986 transitions. [2019-12-18 16:10:49,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:10:49,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:49,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:49,698 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-18 16:10:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-18 16:10:49,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:49,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571243121] [2019-12-18 16:10:49,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:49,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571243121] [2019-12-18 16:10:49,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:49,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:10:49,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418399036] [2019-12-18 16:10:49,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:10:49,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:10:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:49,749 INFO L87 Difference]: Start difference. First operand 19933 states and 61986 transitions. Second operand 3 states. [2019-12-18 16:10:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:49,832 INFO L93 Difference]: Finished difference Result 19932 states and 61984 transitions. [2019-12-18 16:10:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:10:49,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:10:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:49,872 INFO L225 Difference]: With dead ends: 19932 [2019-12-18 16:10:49,872 INFO L226 Difference]: Without dead ends: 19932 [2019-12-18 16:10:49,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19932 states. [2019-12-18 16:10:50,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19932 to 19932. [2019-12-18 16:10:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19932 states. [2019-12-18 16:10:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19932 states to 19932 states and 61984 transitions. [2019-12-18 16:10:50,193 INFO L78 Accepts]: Start accepts. Automaton has 19932 states and 61984 transitions. Word has length 39 [2019-12-18 16:10:50,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:50,193 INFO L462 AbstractCegarLoop]: Abstraction has 19932 states and 61984 transitions. [2019-12-18 16:10:50,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:50,193 INFO L276 IsEmpty]: Start isEmpty. Operand 19932 states and 61984 transitions. [2019-12-18 16:10:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:10:50,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:50,220 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-18 16:10:50,220 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-18 16:10:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:50,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-18 16:10:50,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:50,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086459268] [2019-12-18 16:10:50,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:50,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-18 16:10:50,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086459268] [2019-12-18 16:10:50,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:50,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:10:50,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613980028] [2019-12-18 16:10:50,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:10:50,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:10:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:50,267 INFO L87 Difference]: Start difference. First operand 19932 states and 61984 transitions. Second operand 3 states. [2019-12-18 16:10:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:50,380 INFO L93 Difference]: Finished difference Result 34295 states and 106923 transitions. [2019-12-18 16:10:50,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:10:50,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 16:10:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:50,408 INFO L225 Difference]: With dead ends: 34295 [2019-12-18 16:10:50,408 INFO L226 Difference]: Without dead ends: 17356 [2019-12-18 16:10:50,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:10:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17356 states. [2019-12-18 16:10:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17356 to 17261. [2019-12-18 16:10:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17261 states. [2019-12-18 16:10:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17261 states to 17261 states and 52716 transitions. [2019-12-18 16:10:51,060 INFO L78 Accepts]: Start accepts. Automaton has 17261 states and 52716 transitions. Word has length 40 [2019-12-18 16:10:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:51,060 INFO L462 AbstractCegarLoop]: Abstraction has 17261 states and 52716 transitions. [2019-12-18 16:10:51,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:10:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 17261 states and 52716 transitions. [2019-12-18 16:10:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:10:51,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:51,080 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-18 16:10:51,080 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-18 16:10:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:51,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-18 16:10:51,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:51,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898185266] [2019-12-18 16:10:51,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:51,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898185266] [2019-12-18 16:10:51,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:51,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:10:51,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317486933] [2019-12-18 16:10:51,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:10:51,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:51,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:10:51,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:10:51,154 INFO L87 Difference]: Start difference. First operand 17261 states and 52716 transitions. Second operand 5 states. [2019-12-18 16:10:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:51,755 INFO L93 Difference]: Finished difference Result 28722 states and 85986 transitions. [2019-12-18 16:10:51,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:10:51,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:10:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:51,812 INFO L225 Difference]: With dead ends: 28722 [2019-12-18 16:10:51,813 INFO L226 Difference]: Without dead ends: 28722 [2019-12-18 16:10:51,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:10:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28722 states. [2019-12-18 16:10:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28722 to 22632. [2019-12-18 16:10:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22632 states. [2019-12-18 16:10:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22632 states to 22632 states and 68953 transitions. [2019-12-18 16:10:52,200 INFO L78 Accepts]: Start accepts. Automaton has 22632 states and 68953 transitions. Word has length 40 [2019-12-18 16:10:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:52,201 INFO L462 AbstractCegarLoop]: Abstraction has 22632 states and 68953 transitions. [2019-12-18 16:10:52,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:10:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 22632 states and 68953 transitions. [2019-12-18 16:10:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:10:52,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:52,224 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-18 16:10:52,225 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-18 16:10:52,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 3 times [2019-12-18 16:10:52,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:52,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425658157] [2019-12-18 16:10:52,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:52,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425658157] [2019-12-18 16:10:52,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:52,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:10:52,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801899613] [2019-12-18 16:10:52,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:10:52,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:10:52,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:10:52,298 INFO L87 Difference]: Start difference. First operand 22632 states and 68953 transitions. Second operand 6 states. [2019-12-18 16:10:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:53,093 INFO L93 Difference]: Finished difference Result 38264 states and 115758 transitions. [2019-12-18 16:10:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 16:10:53,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 16:10:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:53,150 INFO L225 Difference]: With dead ends: 38264 [2019-12-18 16:10:53,151 INFO L226 Difference]: Without dead ends: 38264 [2019-12-18 16:10:53,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:10:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38264 states. [2019-12-18 16:10:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38264 to 26562. [2019-12-18 16:10:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26562 states. [2019-12-18 16:10:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26562 states to 26562 states and 80887 transitions. [2019-12-18 16:10:53,650 INFO L78 Accepts]: Start accepts. Automaton has 26562 states and 80887 transitions. Word has length 40 [2019-12-18 16:10:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:53,650 INFO L462 AbstractCegarLoop]: Abstraction has 26562 states and 80887 transitions. [2019-12-18 16:10:53,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:10:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 26562 states and 80887 transitions. [2019-12-18 16:10:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:10:53,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:53,681 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-18 16:10:53,681 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-18 16:10:53,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:53,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 4 times [2019-12-18 16:10:53,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:53,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223641993] [2019-12-18 16:10:53,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:53,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223641993] [2019-12-18 16:10:53,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:53,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:10:53,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732446131] [2019-12-18 16:10:53,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:10:53,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:53,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:10:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:10:53,733 INFO L87 Difference]: Start difference. First operand 26562 states and 80887 transitions. Second operand 5 states. [2019-12-18 16:10:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:54,200 INFO L93 Difference]: Finished difference Result 25205 states and 77677 transitions. [2019-12-18 16:10:54,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:10:54,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:10:54,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:54,256 INFO L225 Difference]: With dead ends: 25205 [2019-12-18 16:10:54,256 INFO L226 Difference]: Without dead ends: 23175 [2019-12-18 16:10:54,257 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-18 16:10:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23175 states. [2019-12-18 16:10:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23175 to 22090. [2019-12-18 16:10:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22090 states. [2019-12-18 16:10:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22090 states to 22090 states and 69790 transitions. [2019-12-18 16:10:54,792 INFO L78 Accepts]: Start accepts. Automaton has 22090 states and 69790 transitions. Word has length 40 [2019-12-18 16:10:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:54,792 INFO L462 AbstractCegarLoop]: Abstraction has 22090 states and 69790 transitions. [2019-12-18 16:10:54,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:10:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 22090 states and 69790 transitions. [2019-12-18 16:10:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:10:54,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:54,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:54,818 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-18 16:10:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 275512574, now seen corresponding path program 1 times [2019-12-18 16:10:54,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:54,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416207306] [2019-12-18 16:10:54,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:54,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416207306] [2019-12-18 16:10:54,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:54,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:10:54,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533728161] [2019-12-18 16:10:54,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:10:54,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:10:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:10:54,912 INFO L87 Difference]: Start difference. First operand 22090 states and 69790 transitions. Second operand 7 states. [2019-12-18 16:10:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:55,577 INFO L93 Difference]: Finished difference Result 71641 states and 223436 transitions. [2019-12-18 16:10:55,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:10:55,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:10:55,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:55,687 INFO L225 Difference]: With dead ends: 71641 [2019-12-18 16:10:55,687 INFO L226 Difference]: Without dead ends: 49982 [2019-12-18 16:10:55,688 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-18 16:10:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49982 states. [2019-12-18 16:10:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49982 to 25474. [2019-12-18 16:10:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25474 states. [2019-12-18 16:10:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25474 states to 25474 states and 80471 transitions. [2019-12-18 16:10:56,347 INFO L78 Accepts]: Start accepts. Automaton has 25474 states and 80471 transitions. Word has length 64 [2019-12-18 16:10:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:56,347 INFO L462 AbstractCegarLoop]: Abstraction has 25474 states and 80471 transitions. [2019-12-18 16:10:56,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:10:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 25474 states and 80471 transitions. [2019-12-18 16:10:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:10:56,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:56,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:56,392 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-18 16:10:56,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:56,392 INFO L82 PathProgramCache]: Analyzing trace with hash 474826606, now seen corresponding path program 2 times [2019-12-18 16:10:56,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:56,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833930561] [2019-12-18 16:10:56,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:56,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833930561] [2019-12-18 16:10:56,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:56,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:10:56,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244609713] [2019-12-18 16:10:56,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:10:56,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:10:56,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:10:56,492 INFO L87 Difference]: Start difference. First operand 25474 states and 80471 transitions. Second operand 8 states. [2019-12-18 16:10:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:10:58,375 INFO L93 Difference]: Finished difference Result 121319 states and 378413 transitions. [2019-12-18 16:10:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:10:58,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 16:10:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:10:58,503 INFO L225 Difference]: With dead ends: 121319 [2019-12-18 16:10:58,503 INFO L226 Difference]: Without dead ends: 83520 [2019-12-18 16:10:58,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 16:10:58,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83520 states. [2019-12-18 16:10:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83520 to 29763. [2019-12-18 16:10:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29763 states. [2019-12-18 16:10:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29763 states to 29763 states and 93873 transitions. [2019-12-18 16:10:59,424 INFO L78 Accepts]: Start accepts. Automaton has 29763 states and 93873 transitions. Word has length 64 [2019-12-18 16:10:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:10:59,425 INFO L462 AbstractCegarLoop]: Abstraction has 29763 states and 93873 transitions. [2019-12-18 16:10:59,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:10:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29763 states and 93873 transitions. [2019-12-18 16:10:59,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:10:59,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:10:59,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:10:59,460 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-18 16:10:59,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:10:59,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1554423936, now seen corresponding path program 3 times [2019-12-18 16:10:59,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:10:59,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323293810] [2019-12-18 16:10:59,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:10:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:10:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:10:59,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323293810] [2019-12-18 16:10:59,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:10:59,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:10:59,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360933744] [2019-12-18 16:10:59,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:10:59,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:10:59,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:10:59,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:10:59,591 INFO L87 Difference]: Start difference. First operand 29763 states and 93873 transitions. Second operand 9 states. [2019-12-18 16:11:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:02,079 INFO L93 Difference]: Finished difference Result 183502 states and 569613 transitions. [2019-12-18 16:11:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 16:11:02,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:11:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:02,337 INFO L225 Difference]: With dead ends: 183502 [2019-12-18 16:11:02,338 INFO L226 Difference]: Without dead ends: 147146 [2019-12-18 16:11:02,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 16:11:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147146 states. [2019-12-18 16:11:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147146 to 36901. [2019-12-18 16:11:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36901 states. [2019-12-18 16:11:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36901 states to 36901 states and 116183 transitions. [2019-12-18 16:11:03,756 INFO L78 Accepts]: Start accepts. Automaton has 36901 states and 116183 transitions. Word has length 64 [2019-12-18 16:11:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:03,756 INFO L462 AbstractCegarLoop]: Abstraction has 36901 states and 116183 transitions. [2019-12-18 16:11:03,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:11:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 36901 states and 116183 transitions. [2019-12-18 16:11:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:11:03,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:03,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:11:03,798 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-18 16:11:03,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash 85476954, now seen corresponding path program 4 times [2019-12-18 16:11:03,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:03,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719606074] [2019-12-18 16:11:03,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:03,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:03,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719606074] [2019-12-18 16:11:03,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:03,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:11:03,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756016873] [2019-12-18 16:11:03,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:11:03,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:03,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:11:03,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:11:03,914 INFO L87 Difference]: Start difference. First operand 36901 states and 116183 transitions. Second operand 9 states. [2019-12-18 16:11:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:06,274 INFO L93 Difference]: Finished difference Result 152963 states and 470241 transitions. [2019-12-18 16:11:06,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:11:06,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:11:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:06,510 INFO L225 Difference]: With dead ends: 152963 [2019-12-18 16:11:06,510 INFO L226 Difference]: Without dead ends: 136610 [2019-12-18 16:11:06,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:11:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136610 states. [2019-12-18 16:11:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136610 to 36028. [2019-12-18 16:11:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36028 states. [2019-12-18 16:11:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36028 states to 36028 states and 113146 transitions. [2019-12-18 16:11:08,619 INFO L78 Accepts]: Start accepts. Automaton has 36028 states and 113146 transitions. Word has length 64 [2019-12-18 16:11:08,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:08,619 INFO L462 AbstractCegarLoop]: Abstraction has 36028 states and 113146 transitions. [2019-12-18 16:11:08,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:11:08,620 INFO L276 IsEmpty]: Start isEmpty. Operand 36028 states and 113146 transitions. [2019-12-18 16:11:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:11:08,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:08,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:11:08,664 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-18 16:11:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:08,664 INFO L82 PathProgramCache]: Analyzing trace with hash 812479892, now seen corresponding path program 5 times [2019-12-18 16:11:08,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:08,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589906539] [2019-12-18 16:11:08,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:08,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589906539] [2019-12-18 16:11:08,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:08,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:11:08,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612258909] [2019-12-18 16:11:08,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:11:08,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:11:08,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:11:08,753 INFO L87 Difference]: Start difference. First operand 36028 states and 113146 transitions. Second operand 7 states. [2019-12-18 16:11:09,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:09,262 INFO L93 Difference]: Finished difference Result 78427 states and 241207 transitions. [2019-12-18 16:11:09,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:11:09,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:11:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:09,372 INFO L225 Difference]: With dead ends: 78427 [2019-12-18 16:11:09,372 INFO L226 Difference]: Without dead ends: 67537 [2019-12-18 16:11:09,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:11:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67537 states. [2019-12-18 16:11:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67537 to 36092. [2019-12-18 16:11:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2019-12-18 16:11:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 113275 transitions. [2019-12-18 16:11:10,231 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 113275 transitions. Word has length 64 [2019-12-18 16:11:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:10,231 INFO L462 AbstractCegarLoop]: Abstraction has 36092 states and 113275 transitions. [2019-12-18 16:11:10,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:11:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 113275 transitions. [2019-12-18 16:11:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:11:10,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:10,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] [2019-12-18 16:11:10,275 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-18 16:11:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:10,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1442601312, now seen corresponding path program 6 times [2019-12-18 16:11:10,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:10,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991169195] [2019-12-18 16:11:10,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:10,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991169195] [2019-12-18 16:11:10,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:10,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:11:10,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223656598] [2019-12-18 16:11:10,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:11:10,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:10,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:11:10,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:11:10,331 INFO L87 Difference]: Start difference. First operand 36092 states and 113275 transitions. Second operand 3 states. [2019-12-18 16:11:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:10,502 INFO L93 Difference]: Finished difference Result 43565 states and 135551 transitions. [2019-12-18 16:11:10,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:11:10,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:11:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:10,568 INFO L225 Difference]: With dead ends: 43565 [2019-12-18 16:11:10,568 INFO L226 Difference]: Without dead ends: 43565 [2019-12-18 16:11:10,568 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-18 16:11:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43565 states. [2019-12-18 16:11:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43565 to 37697. [2019-12-18 16:11:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37697 states. [2019-12-18 16:11:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37697 states to 37697 states and 118019 transitions. [2019-12-18 16:11:11,606 INFO L78 Accepts]: Start accepts. Automaton has 37697 states and 118019 transitions. Word has length 64 [2019-12-18 16:11:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:11,606 INFO L462 AbstractCegarLoop]: Abstraction has 37697 states and 118019 transitions. [2019-12-18 16:11:11,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:11:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 37697 states and 118019 transitions. [2019-12-18 16:11:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:11,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:11,651 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-18 16:11:11,651 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-18 16:11:11,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:11,652 INFO L82 PathProgramCache]: Analyzing trace with hash 318332456, now seen corresponding path program 1 times [2019-12-18 16:11:11,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:11,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781506783] [2019-12-18 16:11:11,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:11,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781506783] [2019-12-18 16:11:11,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:11,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:11:11,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474949965] [2019-12-18 16:11:11,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:11:11,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:11,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:11:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:11:11,760 INFO L87 Difference]: Start difference. First operand 37697 states and 118019 transitions. Second operand 8 states. [2019-12-18 16:11:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:12,888 INFO L93 Difference]: Finished difference Result 110742 states and 342175 transitions. [2019-12-18 16:11:12,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:11:12,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:11:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:13,059 INFO L225 Difference]: With dead ends: 110742 [2019-12-18 16:11:13,059 INFO L226 Difference]: Without dead ends: 104366 [2019-12-18 16:11:13,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 16:11:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104366 states. [2019-12-18 16:11:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104366 to 38232. [2019-12-18 16:11:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38232 states. [2019-12-18 16:11:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38232 states to 38232 states and 119962 transitions. [2019-12-18 16:11:14,802 INFO L78 Accepts]: Start accepts. Automaton has 38232 states and 119962 transitions. Word has length 65 [2019-12-18 16:11:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:14,802 INFO L462 AbstractCegarLoop]: Abstraction has 38232 states and 119962 transitions. [2019-12-18 16:11:14,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:11:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 38232 states and 119962 transitions. [2019-12-18 16:11:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:14,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:14,849 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-18 16:11:14,849 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-18 16:11:14,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918528, now seen corresponding path program 2 times [2019-12-18 16:11:14,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:14,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634167238] [2019-12-18 16:11:14,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:14,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634167238] [2019-12-18 16:11:14,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:14,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:11:14,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589853599] [2019-12-18 16:11:14,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:11:14,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:11:14,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:11:14,955 INFO L87 Difference]: Start difference. First operand 38232 states and 119962 transitions. Second operand 9 states. [2019-12-18 16:11:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:16,971 INFO L93 Difference]: Finished difference Result 162694 states and 499460 transitions. [2019-12-18 16:11:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 16:11:16,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:11:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:17,196 INFO L225 Difference]: With dead ends: 162694 [2019-12-18 16:11:17,196 INFO L226 Difference]: Without dead ends: 133747 [2019-12-18 16:11:17,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 16:11:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133747 states. [2019-12-18 16:11:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133747 to 40104. [2019-12-18 16:11:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40104 states. [2019-12-18 16:11:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40104 states to 40104 states and 124943 transitions. [2019-12-18 16:11:19,230 INFO L78 Accepts]: Start accepts. Automaton has 40104 states and 124943 transitions. Word has length 65 [2019-12-18 16:11:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:19,230 INFO L462 AbstractCegarLoop]: Abstraction has 40104 states and 124943 transitions. [2019-12-18 16:11:19,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:11:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 40104 states and 124943 transitions. [2019-12-18 16:11:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:19,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:19,276 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-18 16:11:19,276 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-18 16:11:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 704301340, now seen corresponding path program 3 times [2019-12-18 16:11:19,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:19,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015401253] [2019-12-18 16:11:19,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:19,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015401253] [2019-12-18 16:11:19,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:19,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:11:19,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942511313] [2019-12-18 16:11:19,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:11:19,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:19,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:11:19,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:11:19,378 INFO L87 Difference]: Start difference. First operand 40104 states and 124943 transitions. Second operand 9 states. [2019-12-18 16:11:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:20,945 INFO L93 Difference]: Finished difference Result 132350 states and 403587 transitions. [2019-12-18 16:11:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 16:11:20,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:11:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:21,144 INFO L225 Difference]: With dead ends: 132350 [2019-12-18 16:11:21,144 INFO L226 Difference]: Without dead ends: 123567 [2019-12-18 16:11:21,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:11:21,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123567 states. [2019-12-18 16:11:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123567 to 38361. [2019-12-18 16:11:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38361 states. [2019-12-18 16:11:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38361 states to 38361 states and 120038 transitions. [2019-12-18 16:11:22,919 INFO L78 Accepts]: Start accepts. Automaton has 38361 states and 120038 transitions. Word has length 65 [2019-12-18 16:11:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:22,919 INFO L462 AbstractCegarLoop]: Abstraction has 38361 states and 120038 transitions. [2019-12-18 16:11:22,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:11:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38361 states and 120038 transitions. [2019-12-18 16:11:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:22,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:22,964 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-18 16:11:22,964 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-18 16:11:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1422061222, now seen corresponding path program 1 times [2019-12-18 16:11:22,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:22,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62027826] [2019-12-18 16:11:22,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:23,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62027826] [2019-12-18 16:11:23,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:23,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:11:23,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706837119] [2019-12-18 16:11:23,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:11:23,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:11:23,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:11:23,071 INFO L87 Difference]: Start difference. First operand 38361 states and 120038 transitions. Second operand 7 states. [2019-12-18 16:11:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:24,707 INFO L93 Difference]: Finished difference Result 72689 states and 223173 transitions. [2019-12-18 16:11:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:11:24,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:11:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:24,818 INFO L225 Difference]: With dead ends: 72689 [2019-12-18 16:11:24,818 INFO L226 Difference]: Without dead ends: 72689 [2019-12-18 16:11:24,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:11:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72689 states. [2019-12-18 16:11:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72689 to 39164. [2019-12-18 16:11:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39164 states. [2019-12-18 16:11:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39164 states to 39164 states and 122420 transitions. [2019-12-18 16:11:25,696 INFO L78 Accepts]: Start accepts. Automaton has 39164 states and 122420 transitions. Word has length 65 [2019-12-18 16:11:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:25,696 INFO L462 AbstractCegarLoop]: Abstraction has 39164 states and 122420 transitions. [2019-12-18 16:11:25,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:11:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 39164 states and 122420 transitions. [2019-12-18 16:11:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:25,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:25,742 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-18 16:11:25,742 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-18 16:11:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1551355630, now seen corresponding path program 4 times [2019-12-18 16:11:25,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:25,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615779552] [2019-12-18 16:11:25,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:26,171 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-18 16:11:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:26,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615779552] [2019-12-18 16:11:26,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:26,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:11:26,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730515845] [2019-12-18 16:11:26,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:11:26,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:26,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:11:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:11:26,180 INFO L87 Difference]: Start difference. First operand 39164 states and 122420 transitions. Second operand 7 states. [2019-12-18 16:11:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:27,818 INFO L93 Difference]: Finished difference Result 71669 states and 218462 transitions. [2019-12-18 16:11:27,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:11:27,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 16:11:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:27,943 INFO L225 Difference]: With dead ends: 71669 [2019-12-18 16:11:27,943 INFO L226 Difference]: Without dead ends: 71669 [2019-12-18 16:11:27,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:11:28,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71669 states. [2019-12-18 16:11:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71669 to 40591. [2019-12-18 16:11:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40591 states. [2019-12-18 16:11:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40591 states to 40591 states and 126291 transitions. [2019-12-18 16:11:28,853 INFO L78 Accepts]: Start accepts. Automaton has 40591 states and 126291 transitions. Word has length 65 [2019-12-18 16:11:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:28,853 INFO L462 AbstractCegarLoop]: Abstraction has 40591 states and 126291 transitions. [2019-12-18 16:11:28,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:11:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 40591 states and 126291 transitions. [2019-12-18 16:11:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:28,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:28,899 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-18 16:11:28,899 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-18 16:11:28,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 2 times [2019-12-18 16:11:28,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:28,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772980023] [2019-12-18 16:11:28,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:29,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772980023] [2019-12-18 16:11:29,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:29,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:11:29,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145158014] [2019-12-18 16:11:29,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:11:29,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:29,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:11:29,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:11:29,039 INFO L87 Difference]: Start difference. First operand 40591 states and 126291 transitions. Second operand 8 states. [2019-12-18 16:11:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:31,107 INFO L93 Difference]: Finished difference Result 83304 states and 256159 transitions. [2019-12-18 16:11:31,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:11:31,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:11:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:31,239 INFO L225 Difference]: With dead ends: 83304 [2019-12-18 16:11:31,239 INFO L226 Difference]: Without dead ends: 83304 [2019-12-18 16:11:31,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 16:11:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83304 states. [2019-12-18 16:11:32,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83304 to 42985. [2019-12-18 16:11:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42985 states. [2019-12-18 16:11:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42985 states to 42985 states and 134776 transitions. [2019-12-18 16:11:32,549 INFO L78 Accepts]: Start accepts. Automaton has 42985 states and 134776 transitions. Word has length 65 [2019-12-18 16:11:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:32,549 INFO L462 AbstractCegarLoop]: Abstraction has 42985 states and 134776 transitions. [2019-12-18 16:11:32,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:11:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 42985 states and 134776 transitions. [2019-12-18 16:11:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:32,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:32,601 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-18 16:11:32,602 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-18 16:11:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 3 times [2019-12-18 16:11:32,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:32,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476843046] [2019-12-18 16:11:32,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:32,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476843046] [2019-12-18 16:11:32,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:32,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:11:32,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590673531] [2019-12-18 16:11:32,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:11:32,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:32,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:11:32,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:11:32,728 INFO L87 Difference]: Start difference. First operand 42985 states and 134776 transitions. Second operand 9 states. [2019-12-18 16:11:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:35,882 INFO L93 Difference]: Finished difference Result 85435 states and 261703 transitions. [2019-12-18 16:11:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 16:11:35,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:11:35,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:36,019 INFO L225 Difference]: With dead ends: 85435 [2019-12-18 16:11:36,019 INFO L226 Difference]: Without dead ends: 85183 [2019-12-18 16:11:36,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=1629, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 16:11:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85183 states. [2019-12-18 16:11:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85183 to 47025. [2019-12-18 16:11:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47025 states. [2019-12-18 16:11:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47025 states to 47025 states and 147406 transitions. [2019-12-18 16:11:37,471 INFO L78 Accepts]: Start accepts. Automaton has 47025 states and 147406 transitions. Word has length 65 [2019-12-18 16:11:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:37,471 INFO L462 AbstractCegarLoop]: Abstraction has 47025 states and 147406 transitions. [2019-12-18 16:11:37,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:11:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 47025 states and 147406 transitions. [2019-12-18 16:11:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:37,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:37,526 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-18 16:11:37,526 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-18 16:11:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1064039577, now seen corresponding path program 1 times [2019-12-18 16:11:37,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:37,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408049091] [2019-12-18 16:11:37,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:37,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408049091] [2019-12-18 16:11:37,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:37,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:11:37,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977253006] [2019-12-18 16:11:37,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:11:37,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:37,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:11:37,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:11:37,584 INFO L87 Difference]: Start difference. First operand 47025 states and 147406 transitions. Second operand 4 states. [2019-12-18 16:11:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:37,967 INFO L93 Difference]: Finished difference Result 54410 states and 169801 transitions. [2019-12-18 16:11:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:11:37,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 16:11:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:38,113 INFO L225 Difference]: With dead ends: 54410 [2019-12-18 16:11:38,113 INFO L226 Difference]: Without dead ends: 54410 [2019-12-18 16:11:38,114 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-18 16:11:38,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54410 states. [2019-12-18 16:11:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54410 to 46432. [2019-12-18 16:11:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46432 states. [2019-12-18 16:11:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46432 states to 46432 states and 145982 transitions. [2019-12-18 16:11:39,094 INFO L78 Accepts]: Start accepts. Automaton has 46432 states and 145982 transitions. Word has length 65 [2019-12-18 16:11:39,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:39,095 INFO L462 AbstractCegarLoop]: Abstraction has 46432 states and 145982 transitions. [2019-12-18 16:11:39,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:11:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46432 states and 145982 transitions. [2019-12-18 16:11:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:39,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:39,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:11:39,151 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-18 16:11:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1405468218, now seen corresponding path program 4 times [2019-12-18 16:11:39,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:39,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121259452] [2019-12-18 16:11:39,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:39,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121259452] [2019-12-18 16:11:39,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:39,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:11:39,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265843698] [2019-12-18 16:11:39,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:11:39,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:39,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:11:39,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:11:39,418 INFO L87 Difference]: Start difference. First operand 46432 states and 145982 transitions. Second operand 11 states. [2019-12-18 16:11:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:42,637 INFO L93 Difference]: Finished difference Result 107966 states and 329365 transitions. [2019-12-18 16:11:42,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:11:42,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:11:42,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:42,824 INFO L225 Difference]: With dead ends: 107966 [2019-12-18 16:11:42,824 INFO L226 Difference]: Without dead ends: 107924 [2019-12-18 16:11:42,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2019-12-18 16:11:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107924 states. [2019-12-18 16:11:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107924 to 53285. [2019-12-18 16:11:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53285 states. [2019-12-18 16:11:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53285 states to 53285 states and 168235 transitions. [2019-12-18 16:11:44,263 INFO L78 Accepts]: Start accepts. Automaton has 53285 states and 168235 transitions. Word has length 65 [2019-12-18 16:11:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:44,264 INFO L462 AbstractCegarLoop]: Abstraction has 53285 states and 168235 transitions. [2019-12-18 16:11:44,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:11:44,264 INFO L276 IsEmpty]: Start isEmpty. Operand 53285 states and 168235 transitions. [2019-12-18 16:11:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:44,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:44,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] [2019-12-18 16:11:44,330 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-18 16:11:44,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash 948922880, now seen corresponding path program 5 times [2019-12-18 16:11:44,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:44,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980387988] [2019-12-18 16:11:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:44,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980387988] [2019-12-18 16:11:44,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:44,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:11:44,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035447408] [2019-12-18 16:11:44,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 16:11:44,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:44,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 16:11:44,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:11:44,476 INFO L87 Difference]: Start difference. First operand 53285 states and 168235 transitions. Second operand 8 states. [2019-12-18 16:11:46,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:46,809 INFO L93 Difference]: Finished difference Result 113716 states and 348326 transitions. [2019-12-18 16:11:46,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 16:11:46,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 16:11:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:47,004 INFO L225 Difference]: With dead ends: 113716 [2019-12-18 16:11:47,004 INFO L226 Difference]: Without dead ends: 113632 [2019-12-18 16:11:47,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-18 16:11:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113632 states. [2019-12-18 16:11:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113632 to 53023. [2019-12-18 16:11:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53023 states. [2019-12-18 16:11:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53023 states to 53023 states and 168010 transitions. [2019-12-18 16:11:48,533 INFO L78 Accepts]: Start accepts. Automaton has 53023 states and 168010 transitions. Word has length 65 [2019-12-18 16:11:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:48,533 INFO L462 AbstractCegarLoop]: Abstraction has 53023 states and 168010 transitions. [2019-12-18 16:11:48,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 16:11:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 53023 states and 168010 transitions. [2019-12-18 16:11:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:11:48,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:48,601 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-18 16:11:48,601 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-18 16:11:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1428822976, now seen corresponding path program 6 times [2019-12-18 16:11:48,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:48,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155633689] [2019-12-18 16:11:48,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:48,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155633689] [2019-12-18 16:11:48,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:48,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:11:48,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155659725] [2019-12-18 16:11:48,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:11:48,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:11:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:11:48,664 INFO L87 Difference]: Start difference. First operand 53023 states and 168010 transitions. Second operand 3 states. [2019-12-18 16:11:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:48,951 INFO L93 Difference]: Finished difference Result 53023 states and 168009 transitions. [2019-12-18 16:11:48,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:11:48,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:11:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:49,099 INFO L225 Difference]: With dead ends: 53023 [2019-12-18 16:11:49,099 INFO L226 Difference]: Without dead ends: 53023 [2019-12-18 16:11:49,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:11:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53023 states. [2019-12-18 16:11:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53023 to 33747. [2019-12-18 16:11:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33747 states. [2019-12-18 16:11:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33747 states to 33747 states and 108930 transitions. [2019-12-18 16:11:50,296 INFO L78 Accepts]: Start accepts. Automaton has 33747 states and 108930 transitions. Word has length 65 [2019-12-18 16:11:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:50,296 INFO L462 AbstractCegarLoop]: Abstraction has 33747 states and 108930 transitions. [2019-12-18 16:11:50,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:11:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 33747 states and 108930 transitions. [2019-12-18 16:11:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:11:50,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:50,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:11:50,336 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-18 16:11:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -927878062, now seen corresponding path program 1 times [2019-12-18 16:11:50,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:50,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668321289] [2019-12-18 16:11:50,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:11:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:11:50,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668321289] [2019-12-18 16:11:50,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:11:50,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:11:50,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439835316] [2019-12-18 16:11:50,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:11:50,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:11:50,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:11:50,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:11:50,392 INFO L87 Difference]: Start difference. First operand 33747 states and 108930 transitions. Second operand 3 states. [2019-12-18 16:11:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:11:50,489 INFO L93 Difference]: Finished difference Result 24700 states and 79049 transitions. [2019-12-18 16:11:50,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:11:50,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:11:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:11:50,526 INFO L225 Difference]: With dead ends: 24700 [2019-12-18 16:11:50,526 INFO L226 Difference]: Without dead ends: 24700 [2019-12-18 16:11:50,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:11:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24700 states. [2019-12-18 16:11:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24700 to 21575. [2019-12-18 16:11:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21575 states. [2019-12-18 16:11:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21575 states to 21575 states and 68870 transitions. [2019-12-18 16:11:50,890 INFO L78 Accepts]: Start accepts. Automaton has 21575 states and 68870 transitions. Word has length 66 [2019-12-18 16:11:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:11:50,890 INFO L462 AbstractCegarLoop]: Abstraction has 21575 states and 68870 transitions. [2019-12-18 16:11:50,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:11:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 21575 states and 68870 transitions. [2019-12-18 16:11:50,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:11:50,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:11:50,916 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-18 16:11:50,916 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:11:50,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:11:50,916 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-18 16:11:50,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:11:50,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536160534] [2019-12-18 16:11:50,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:11:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:11:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:11:51,047 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:11:51,048 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:11:51,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t153~0.base_27| 4) |v_#length_23|) (= v_~weak$$choice2~0_147 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= |v_ULTIMATE.start_main_~#t153~0.offset_17| 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27| 1) |v_#valid_73|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t153~0.base_27|) 0) (= 0 v_~x~0_154) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t153~0.base_27|) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_27|) |v_ULTIMATE.start_main_~#t153~0.offset_17| 0)) |v_#memory_int_19|) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_16|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ULTIMATE.start_main_~#t153~0.base=|v_ULTIMATE.start_main_~#t153~0.base_27|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_22|, ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ULTIMATE.start_main_~#t153~0.offset=|v_ULTIMATE.start_main_~#t153~0.offset_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t153~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t155~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t154~0.base, ULTIMATE.start_main_~#t155~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t153~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:11:51,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t154~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t154~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11|) |v_ULTIMATE.start_main_~#t154~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t154~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t154~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t154~0.base] because there is no mapped edge [2019-12-18 16:11:51,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 16:11:51,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In871491620 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In871491620 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out871491620| ~z~0_In871491620) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out871491620| ~z$w_buff1~0_In871491620)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In871491620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In871491620, ~z$w_buff1~0=~z$w_buff1~0_In871491620, ~z~0=~z~0_In871491620} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out871491620|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In871491620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In871491620, ~z$w_buff1~0=~z$w_buff1~0_In871491620, ~z~0=~z~0_In871491620} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 16:11:51,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 16:11:51,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1347642475 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1347642475 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1347642475| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1347642475| ~z$w_buff0_used~0_In1347642475) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1347642475, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1347642475} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1347642475, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1347642475|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1347642475} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:11:51,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In468017514 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In468017514 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In468017514 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In468017514 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out468017514| ~z$w_buff1_used~0_In468017514) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out468017514| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In468017514, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In468017514, ~z$w_buff1_used~0=~z$w_buff1_used~0_In468017514, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In468017514} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In468017514, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In468017514, ~z$w_buff1_used~0=~z$w_buff1_used~0_In468017514, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out468017514|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In468017514} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:11:51,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9|) |v_ULTIMATE.start_main_~#t155~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t155~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t155~0.base_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t155~0.base_9| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t155~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t155~0.base, ULTIMATE.start_main_~#t155~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 16:11:51,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1795867266 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-1795867266| ~z$w_buff0~0_In-1795867266) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-1795867266| |P2Thread1of1ForFork0_#t~ite20_Out-1795867266|)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-1795867266| ~z$w_buff0~0_In-1795867266) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1795867266 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1795867266 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1795867266 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1795867266 256))))) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out-1795867266| |P2Thread1of1ForFork0_#t~ite20_Out-1795867266|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1795867266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1795867266, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1795867266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1795867266, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1795867266, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1795867266|, ~weak$$choice2~0=~weak$$choice2~0_In-1795867266} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1795867266|, ~z$w_buff0~0=~z$w_buff0~0_In-1795867266, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1795867266, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1795867266, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1795867266, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1795867266, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1795867266|, ~weak$$choice2~0=~weak$$choice2~0_In-1795867266} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 16:11:51,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1683184130 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1683184130 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1683184130 |P1Thread1of1ForFork2_#t~ite13_Out-1683184130|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1683184130|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683184130, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1683184130} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683184130, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1683184130|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1683184130} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:11:51,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-978452331 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-978452331 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-978452331 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-978452331 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-978452331| ~z$r_buff1_thd2~0_In-978452331) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-978452331|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-978452331, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-978452331, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-978452331, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-978452331} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-978452331, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-978452331, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-978452331, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-978452331|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-978452331} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:11:51,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:11:51,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In836716809 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In836716809 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In836716809 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In836716809 256))) (and (= (mod ~z$w_buff1_used~0_In836716809 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite23_Out836716809| |P2Thread1of1ForFork0_#t~ite24_Out836716809|) (= |P2Thread1of1ForFork0_#t~ite23_Out836716809| ~z$w_buff1~0_In836716809) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite23_In836716809| |P2Thread1of1ForFork0_#t~ite23_Out836716809|) (= ~z$w_buff1~0_In836716809 |P2Thread1of1ForFork0_#t~ite24_Out836716809|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In836716809, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In836716809, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In836716809|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In836716809, ~z$w_buff1~0=~z$w_buff1~0_In836716809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In836716809, ~weak$$choice2~0=~weak$$choice2~0_In836716809} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In836716809, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out836716809|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In836716809, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out836716809|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In836716809, ~z$w_buff1~0=~z$w_buff1~0_In836716809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In836716809, ~weak$$choice2~0=~weak$$choice2~0_In836716809} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 16:11:51,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In898193181 256) 0))) (or (and (= ~z$w_buff0_used~0_In898193181 |P2Thread1of1ForFork0_#t~ite26_Out898193181|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In898193181 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In898193181 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In898193181 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In898193181 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite27_Out898193181| |P2Thread1of1ForFork0_#t~ite26_Out898193181|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In898193181| |P2Thread1of1ForFork0_#t~ite26_Out898193181|) (= ~z$w_buff0_used~0_In898193181 |P2Thread1of1ForFork0_#t~ite27_Out898193181|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In898193181|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In898193181, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In898193181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In898193181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In898193181, ~weak$$choice2~0=~weak$$choice2~0_In898193181} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out898193181|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out898193181|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In898193181, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In898193181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In898193181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In898193181, ~weak$$choice2~0=~weak$$choice2~0_In898193181} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 16:11:51,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:11:51,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 16:11:51,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1731254031 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1731254031 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1731254031|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1731254031 |P0Thread1of1ForFork1_#t~ite5_Out-1731254031|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1731254031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1731254031} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1731254031|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1731254031, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1731254031} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:11:51,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1144330290 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1144330290 256)))) (or (and (= ~z~0_In1144330290 |P2Thread1of1ForFork0_#t~ite38_Out1144330290|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In1144330290 |P2Thread1of1ForFork0_#t~ite38_Out1144330290|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1144330290, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1144330290, ~z$w_buff1~0=~z$w_buff1~0_In1144330290, ~z~0=~z~0_In1144330290} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1144330290|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1144330290, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1144330290, ~z$w_buff1~0=~z$w_buff1~0_In1144330290, ~z~0=~z~0_In1144330290} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:11:51,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In269642891 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In269642891 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In269642891 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd1~0_In269642891 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out269642891|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In269642891 |P0Thread1of1ForFork1_#t~ite6_Out269642891|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In269642891, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In269642891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In269642891, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In269642891} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In269642891, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out269642891|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In269642891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In269642891, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In269642891} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:11:51,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1405351385 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1405351385 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-1405351385 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out-1405351385 ~z$r_buff0_thd1~0_In-1405351385) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405351385, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405351385} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405351385, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1405351385|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1405351385} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:11:51,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1490484813 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1490484813 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1490484813 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In1490484813 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1490484813|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1490484813 |P0Thread1of1ForFork1_#t~ite8_Out1490484813|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1490484813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1490484813, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1490484813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1490484813} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1490484813|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1490484813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1490484813, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1490484813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1490484813} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:11:51,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:11:51,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 16:11:51,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In463455882 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In463455882 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out463455882| ~z$w_buff0_used~0_In463455882)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out463455882| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In463455882, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In463455882} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In463455882, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out463455882|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In463455882} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:11:51,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In898599548 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In898599548 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In898599548 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In898599548 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out898599548|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In898599548 |P2Thread1of1ForFork0_#t~ite41_Out898599548|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In898599548, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In898599548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In898599548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In898599548} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In898599548, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In898599548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In898599548, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In898599548, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out898599548|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:11:51,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In190521429 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In190521429 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out190521429| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out190521429| ~z$r_buff0_thd3~0_In190521429)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In190521429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190521429} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In190521429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190521429, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out190521429|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:11:51,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1283121161 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1283121161 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1283121161 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1283121161 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1283121161| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out-1283121161| ~z$r_buff1_thd3~0_In-1283121161)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283121161, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1283121161, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283121161, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1283121161} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1283121161|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1283121161, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1283121161, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1283121161, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1283121161} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:11:51,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:11:51,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:11:51,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1443191418 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1443191418 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1443191418| |ULTIMATE.start_main_#t~ite48_Out-1443191418|))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1443191418| ~z$w_buff1~0_In-1443191418)) (and (or .cse1 .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1443191418| ~z~0_In-1443191418)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1443191418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1443191418, ~z$w_buff1~0=~z$w_buff1~0_In-1443191418, ~z~0=~z~0_In-1443191418} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1443191418, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1443191418|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1443191418, ~z$w_buff1~0=~z$w_buff1~0_In-1443191418, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1443191418|, ~z~0=~z~0_In-1443191418} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 16:11:51,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1922931583 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1922931583 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1922931583|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1922931583 |ULTIMATE.start_main_#t~ite49_Out1922931583|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1922931583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1922931583} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1922931583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1922931583, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1922931583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:11:51,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-10461792 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-10461792 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-10461792 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-10461792 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-10461792|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-10461792| ~z$w_buff1_used~0_In-10461792) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-10461792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-10461792, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-10461792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-10461792} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-10461792|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-10461792, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-10461792, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-10461792, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-10461792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:11:51,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In2015616347 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2015616347 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In2015616347 |ULTIMATE.start_main_#t~ite51_Out2015616347|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out2015616347|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2015616347, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2015616347} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2015616347, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2015616347|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2015616347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:11:51,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In526542018 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In526542018 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In526542018 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In526542018 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In526542018 |ULTIMATE.start_main_#t~ite52_Out526542018|)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out526542018|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In526542018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In526542018, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In526542018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In526542018} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out526542018|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In526542018, ~z$w_buff0_used~0=~z$w_buff0_used~0_In526542018, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In526542018, ~z$w_buff1_used~0=~z$w_buff1_used~0_In526542018} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:11:51,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:11:51,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:11:51 BasicIcfg [2019-12-18 16:11:51,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:11:51,198 INFO L168 Benchmark]: Toolchain (without parser) took 144392.50 ms. Allocated memory was 146.3 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 102.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 16:11:51,198 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 16:11:51,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.84 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 157.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:51,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.96 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:51,199 INFO L168 Benchmark]: Boogie Preprocessor took 40.28 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:51,200 INFO L168 Benchmark]: RCFGBuilder took 891.02 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 102.1 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:11:51,200 INFO L168 Benchmark]: TraceAbstraction took 142614.84 ms. Allocated memory was 203.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 102.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-18 16:11:51,202 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.84 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 102.7 MB in the beginning and 157.4 MB in the end (delta: -54.7 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.96 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.28 ms. Allocated memory is still 203.9 MB. Free memory was 154.9 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 891.02 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 102.1 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142614.84 ms. Allocated memory was 203.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 102.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 142.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 54.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9460 SDtfs, 15576 SDslu, 29239 SDs, 0 SdLazy, 20550 SolverSat, 1096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 97 SyntacticMatches, 27 SemanticMatches, 478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2893 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred 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: 57.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 1095485 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1710 NumberOfCodeBlocks, 1710 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1608 ConstructedInterpolants, 0 QuantifiedInterpolants, 320453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...