/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:54:11,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:54:11,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:54:11,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:54:11,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:54:11,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:54:11,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:54:11,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:54:11,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:54:11,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:54:11,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:54:11,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:54:11,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:54:11,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:54:11,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:54:11,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:54:11,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:54:11,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:54:11,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:54:11,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:54:11,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:54:11,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:54:11,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:54:11,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:54:11,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:54:11,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:54:11,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:54:11,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:54:11,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:54:11,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:54:11,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:54:11,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:54:11,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:54:11,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:54:11,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:54:11,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:54:11,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:54:11,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:54:11,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:54:11,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:54:11,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:54:11,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:54:11,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:54:11,664 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:54:11,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:54:11,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:54:11,666 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:54:11,666 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:54:11,666 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:54:11,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:54:11,667 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:54:11,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:54:11,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:54:11,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:54:11,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:54:11,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:54:11,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:54:11,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:54:11,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:54:11,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:54:11,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:54:11,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:54:11,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:54:11,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:54:11,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:54:11,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:54:11,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:54:11,670 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:54:11,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:54:11,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:54:11,671 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:54:11,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:54:11,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:54:11,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:54:11,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:54:11,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:54:11,963 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:54:11,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_rmo.oepc.i [2019-12-18 12:54:12,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c98f2ca/33a9b5de1b974b77a31adab39266ee35/FLAGdacb24406 [2019-12-18 12:54:12,599 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:54:12,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_rmo.oepc.i [2019-12-18 12:54:12,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c98f2ca/33a9b5de1b974b77a31adab39266ee35/FLAGdacb24406 [2019-12-18 12:54:12,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c98f2ca/33a9b5de1b974b77a31adab39266ee35 [2019-12-18 12:54:12,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:54:12,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:54:12,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:12,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:54:12,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:54:12,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:12" (1/1) ... [2019-12-18 12:54:12,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:12, skipping insertion in model container [2019-12-18 12:54:12,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:54:12" (1/1) ... [2019-12-18 12:54:12,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:54:12,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:54:13,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:13,470 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:54:13,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:54:13,664 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:54:13,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13 WrapperNode [2019-12-18 12:54:13,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:54:13,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:13,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:54:13,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:54:13,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:54:13,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:54:13,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:54:13,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:54:13,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (1/1) ... [2019-12-18 12:54:13,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:54:13,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:54:13,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:54:13,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:54:13,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (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 12:54:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:54:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:54:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:54:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:54:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:54:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:54:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:54:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:54:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:54:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:54:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:54:13,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:54:13,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:54:13,845 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 12:54:14,622 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:54:14,622 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:54:14,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:14 BoogieIcfgContainer [2019-12-18 12:54:14,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:54:14,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:54:14,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:54:14,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:54:14,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:54:12" (1/3) ... [2019-12-18 12:54:14,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212b1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:14, skipping insertion in model container [2019-12-18 12:54:14,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:54:13" (2/3) ... [2019-12-18 12:54:14,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212b1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:54:14, skipping insertion in model container [2019-12-18 12:54:14,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:54:14" (3/3) ... [2019-12-18 12:54:14,635 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_rmo.oepc.i [2019-12-18 12:54:14,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:54:14,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:54:14,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:54:14,659 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:54:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,723 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,724 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,739 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,780 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,813 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,815 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:54:14,852 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:54:14,874 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:54:14,874 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:54:14,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:54:14,874 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:54:14,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:54:14,875 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:54:14,875 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:54:14,875 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:54:14,891 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:54:14,894 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:54:15,008 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:54:15,008 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:15,029 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:54:15,056 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:54:15,114 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:54:15,114 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:54:15,129 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:54:15,153 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:54:15,154 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:54:20,201 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-18 12:54:20,616 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:54:20,751 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:54:20,779 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-18 12:54:20,779 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 12:54:20,783 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 12:54:40,174 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 12:54:40,176 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 12:54:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:54:40,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:40,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:54:40,182 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 12:54:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:40,188 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-18 12:54:40,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:40,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341370804] [2019-12-18 12:54:40,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:40,447 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 12:54:40,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341370804] [2019-12-18 12:54:40,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:40,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:54:40,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823178515] [2019-12-18 12:54:40,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:54:40,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:54:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:54:40,470 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 12:54:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:41,847 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-18 12:54:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:54:41,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:54:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:42,445 INFO L225 Difference]: With dead ends: 114110 [2019-12-18 12:54:42,445 INFO L226 Difference]: Without dead ends: 107012 [2019-12-18 12:54:42,446 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 12:54:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-18 12:54:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-18 12:54:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-18 12:54:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-18 12:54:53,246 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-18 12:54:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:53,246 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-18 12:54:53,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:54:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-18 12:54:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:54:53,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:53,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:54:53,251 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 12:54:53,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-18 12:54:53,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:53,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261257363] [2019-12-18 12:54:53,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:53,401 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 12:54:53,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261257363] [2019-12-18 12:54:53,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:53,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:54:53,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139372281] [2019-12-18 12:54:53,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:54:53,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:53,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:54:53,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:54:53,405 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-18 12:54:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:58,750 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-18 12:54:58,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:54:58,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:54:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:59,296 INFO L225 Difference]: With dead ends: 166210 [2019-12-18 12:54:59,296 INFO L226 Difference]: Without dead ends: 166161 [2019-12-18 12:54:59,297 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 12:55:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-18 12:55:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-18 12:55:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-18 12:55:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-18 12:55:12,458 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-18 12:55:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:12,459 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-18 12:55:12,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-18 12:55:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:55:12,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:12,465 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:12,465 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 12:55:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-18 12:55:12,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:12,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860437895] [2019-12-18 12:55:12,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:12,516 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 12:55:12,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860437895] [2019-12-18 12:55:12,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:12,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:12,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947604268] [2019-12-18 12:55:12,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:12,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:12,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:12,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:12,518 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-18 12:55:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:12,656 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-18 12:55:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:12,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:55:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:12,752 INFO L225 Difference]: With dead ends: 33068 [2019-12-18 12:55:12,753 INFO L226 Difference]: Without dead ends: 33068 [2019-12-18 12:55:12,753 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 12:55:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-18 12:55:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-18 12:55:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-18 12:55:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-18 12:55:13,410 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-18 12:55:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:13,410 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-18 12:55:13,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-18 12:55:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:55:13,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:13,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:13,414 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 12:55:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-18 12:55:13,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:13,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642855136] [2019-12-18 12:55:13,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:13,528 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 12:55:13,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642855136] [2019-12-18 12:55:13,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:13,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:13,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324174064] [2019-12-18 12:55:13,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:13,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:13,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:13,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:13,530 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-18 12:55:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:16,142 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-18 12:55:16,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:55:16,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:55:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:16,235 INFO L225 Difference]: With dead ends: 45410 [2019-12-18 12:55:16,236 INFO L226 Difference]: Without dead ends: 45410 [2019-12-18 12:55:16,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:16,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-18 12:55:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-18 12:55:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-18 12:55:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-18 12:55:16,988 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-18 12:55:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:16,989 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-18 12:55:16,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:16,990 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-18 12:55:16,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:55:16,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:17,000 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 12:55:17,000 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 12:55:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:17,000 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-18 12:55:17,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:17,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823555519] [2019-12-18 12:55:17,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:17,091 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 12:55:17,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823555519] [2019-12-18 12:55:17,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:17,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:17,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470090414] [2019-12-18 12:55:17,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:55:17,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:55:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:17,093 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 6 states. [2019-12-18 12:55:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:18,096 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-18 12:55:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:55:18,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 12:55:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:18,208 INFO L225 Difference]: With dead ends: 56872 [2019-12-18 12:55:18,208 INFO L226 Difference]: Without dead ends: 56865 [2019-12-18 12:55:18,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:55:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-18 12:55:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-18 12:55:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-18 12:55:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-18 12:55:19,408 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-18 12:55:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:19,408 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-18 12:55:19,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:55:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-18 12:55:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:55:19,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:19,423 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 12:55:19,423 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 12:55:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:19,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-18 12:55:19,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:19,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632265232] [2019-12-18 12:55:19,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:19,475 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 12:55:19,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632265232] [2019-12-18 12:55:19,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:19,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:19,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196305820] [2019-12-18 12:55:19,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:19,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:19,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:19,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:19,478 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 4 states. [2019-12-18 12:55:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:19,555 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-18 12:55:19,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:55:19,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:55:19,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:19,578 INFO L225 Difference]: With dead ends: 16014 [2019-12-18 12:55:19,578 INFO L226 Difference]: Without dead ends: 16014 [2019-12-18 12:55:19,579 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 12:55:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-18 12:55:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-18 12:55:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-18 12:55:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-18 12:55:19,823 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-18 12:55:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:19,823 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-18 12:55:19,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-18 12:55:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:55:19,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:19,838 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 12:55:19,838 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 12:55:19,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:19,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-18 12:55:19,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:19,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211097825] [2019-12-18 12:55:19,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:19,924 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 12:55:19,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211097825] [2019-12-18 12:55:19,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:19,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:19,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132232996] [2019-12-18 12:55:19,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:55:19,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:19,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:55:19,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:55:19,927 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-18 12:55:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:20,493 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-18 12:55:20,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:55:20,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:55:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:20,526 INFO L225 Difference]: With dead ends: 22624 [2019-12-18 12:55:20,526 INFO L226 Difference]: Without dead ends: 22624 [2019-12-18 12:55:20,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:55:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-18 12:55:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-18 12:55:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-18 12:55:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-18 12:55:20,837 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-18 12:55:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:20,838 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-18 12:55:20,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:55:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-18 12:55:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:55:20,856 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:20,856 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 12:55:20,856 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 12:55:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-18 12:55:20,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:20,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038450468] [2019-12-18 12:55:20,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:20,947 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 12:55:20,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038450468] [2019-12-18 12:55:20,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:20,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:55:20,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325491312] [2019-12-18 12:55:20,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:20,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:20,949 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 7 states. [2019-12-18 12:55:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:22,270 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-18 12:55:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:55:22,270 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:55:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:22,308 INFO L225 Difference]: With dead ends: 24689 [2019-12-18 12:55:22,309 INFO L226 Difference]: Without dead ends: 24689 [2019-12-18 12:55:22,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:55:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-18 12:55:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-18 12:55:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-18 12:55:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-18 12:55:22,617 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-18 12:55:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:22,617 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-18 12:55:22,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-18 12:55:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:55:22,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:22,640 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 12:55:22,640 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 12:55:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:22,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-18 12:55:22,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:22,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081872017] [2019-12-18 12:55:22,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:22,706 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 12:55:22,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081872017] [2019-12-18 12:55:22,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:22,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:22,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699419429] [2019-12-18 12:55:22,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:22,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:22,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:22,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:22,708 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-18 12:55:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:22,815 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-18 12:55:22,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:22,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:55:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:22,838 INFO L225 Difference]: With dead ends: 31245 [2019-12-18 12:55:22,838 INFO L226 Difference]: Without dead ends: 17019 [2019-12-18 12:55:22,839 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 12:55:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-18 12:55:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-18 12:55:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-18 12:55:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-18 12:55:23,087 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-18 12:55:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:23,087 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-18 12:55:23,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-18 12:55:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:55:23,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:23,109 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 12:55:23,109 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 12:55:23,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:23,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-18 12:55:23,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:23,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563898164] [2019-12-18 12:55:23,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:23,200 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 12:55:23,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563898164] [2019-12-18 12:55:23,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:23,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:23,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697354149] [2019-12-18 12:55:23,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:55:23,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:23,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:55:23,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:55:23,203 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 4 states. [2019-12-18 12:55:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:23,332 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-18 12:55:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:55:23,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 12:55:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:23,352 INFO L225 Difference]: With dead ends: 24032 [2019-12-18 12:55:23,353 INFO L226 Difference]: Without dead ends: 10093 [2019-12-18 12:55:23,353 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 12:55:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-18 12:55:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-18 12:55:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-18 12:55:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-18 12:55:23,580 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-18 12:55:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:23,580 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-18 12:55:23,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:55:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-18 12:55:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:55:23,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:23,593 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 12:55:23,593 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 12:55:23,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:23,594 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-18 12:55:23,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:23,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239273850] [2019-12-18 12:55:23,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:23,650 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 12:55:23,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239273850] [2019-12-18 12:55:23,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:23,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:55:23,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253191074] [2019-12-18 12:55:23,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:55:23,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:23,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:55:23,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:55:23,653 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 5 states. [2019-12-18 12:55:23,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:23,713 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-18 12:55:23,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:55:23,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:55:23,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:23,726 INFO L225 Difference]: With dead ends: 9224 [2019-12-18 12:55:23,726 INFO L226 Difference]: Without dead ends: 6480 [2019-12-18 12:55:23,727 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 12:55:23,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-18 12:55:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-18 12:55:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-18 12:55:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-18 12:55:23,843 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-18 12:55:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:23,843 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-18 12:55:23,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:55:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-18 12:55:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:23,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:23,852 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 12:55:23,852 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 12:55:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-18 12:55:23,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:23,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055668700] [2019-12-18 12:55:23,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:23,909 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 12:55:23,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055668700] [2019-12-18 12:55:23,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:23,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:23,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717334706] [2019-12-18 12:55:23,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:23,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:23,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:23,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:23,912 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-18 12:55:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:23,988 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-18 12:55:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:23,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:55:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:24,007 INFO L225 Difference]: With dead ends: 9612 [2019-12-18 12:55:24,007 INFO L226 Difference]: Without dead ends: 9612 [2019-12-18 12:55:24,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-18 12:55:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-18 12:55:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-18 12:55:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-18 12:55:24,215 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-18 12:55:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:24,215 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-18 12:55:24,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-18 12:55:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:24,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:24,230 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 12:55:24,230 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 12:55:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-18 12:55:24,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:24,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814145815] [2019-12-18 12:55:24,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:24,341 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 12:55:24,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814145815] [2019-12-18 12:55:24,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:24,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:55:24,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410786852] [2019-12-18 12:55:24,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:24,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:24,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:24,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:24,344 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 7 states. [2019-12-18 12:55:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:24,733 INFO L93 Difference]: Finished difference Result 14786 states and 46379 transitions. [2019-12-18 12:55:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:55:24,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:55:24,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:24,755 INFO L225 Difference]: With dead ends: 14786 [2019-12-18 12:55:24,755 INFO L226 Difference]: Without dead ends: 11103 [2019-12-18 12:55:24,756 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 12:55:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11103 states. [2019-12-18 12:55:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11103 to 9096. [2019-12-18 12:55:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-18 12:55:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-18 12:55:24,978 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-18 12:55:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:24,978 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-18 12:55:24,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-18 12:55:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:24,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:24,991 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 12:55:24,991 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 12:55:24,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-18 12:55:24,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:24,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514019009] [2019-12-18 12:55:24,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:25,073 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 12:55:25,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514019009] [2019-12-18 12:55:25,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:25,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:55:25,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601387518] [2019-12-18 12:55:25,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:55:25,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:25,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:55:25,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:55:25,075 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 7 states. [2019-12-18 12:55:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:25,353 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-18 12:55:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:55:25,354 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:55:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:25,373 INFO L225 Difference]: With dead ends: 16709 [2019-12-18 12:55:25,373 INFO L226 Difference]: Without dead ends: 12623 [2019-12-18 12:55:25,374 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 12:55:25,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-18 12:55:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-18 12:55:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-18 12:55:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-18 12:55:25,561 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-18 12:55:25,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:25,561 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-18 12:55:25,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:55:25,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-18 12:55:25,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:25,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:25,573 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 12:55:25,573 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 12:55:25,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:25,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-18 12:55:25,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:25,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616206041] [2019-12-18 12:55:25,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:25,694 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 12:55:25,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616206041] [2019-12-18 12:55:25,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:25,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:25,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066868225] [2019-12-18 12:55:25,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:25,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:25,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:25,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:25,696 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 9 states. [2019-12-18 12:55:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:26,831 INFO L93 Difference]: Finished difference Result 36233 states and 111090 transitions. [2019-12-18 12:55:26,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:55:26,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:55:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:26,894 INFO L225 Difference]: With dead ends: 36233 [2019-12-18 12:55:26,894 INFO L226 Difference]: Without dead ends: 32009 [2019-12-18 12:55:26,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:55:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32009 states. [2019-12-18 12:55:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32009 to 10214. [2019-12-18 12:55:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10214 states. [2019-12-18 12:55:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10214 states to 10214 states and 32290 transitions. [2019-12-18 12:55:27,276 INFO L78 Accepts]: Start accepts. Automaton has 10214 states and 32290 transitions. Word has length 64 [2019-12-18 12:55:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:27,276 INFO L462 AbstractCegarLoop]: Abstraction has 10214 states and 32290 transitions. [2019-12-18 12:55:27,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 10214 states and 32290 transitions. [2019-12-18 12:55:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:27,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:27,292 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 12:55:27,292 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 12:55:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1900940369, now seen corresponding path program 1 times [2019-12-18 12:55:27,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:27,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111916436] [2019-12-18 12:55:27,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:27,336 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 12:55:27,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111916436] [2019-12-18 12:55:27,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:27,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:55:27,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247567591] [2019-12-18 12:55:27,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:27,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:27,338 INFO L87 Difference]: Start difference. First operand 10214 states and 32290 transitions. Second operand 3 states. [2019-12-18 12:55:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:27,416 INFO L93 Difference]: Finished difference Result 12867 states and 40113 transitions. [2019-12-18 12:55:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:27,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:55:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:27,438 INFO L225 Difference]: With dead ends: 12867 [2019-12-18 12:55:27,438 INFO L226 Difference]: Without dead ends: 12867 [2019-12-18 12:55:27,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12867 states. [2019-12-18 12:55:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12867 to 10671. [2019-12-18 12:55:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10671 states. [2019-12-18 12:55:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10671 states to 10671 states and 33392 transitions. [2019-12-18 12:55:27,639 INFO L78 Accepts]: Start accepts. Automaton has 10671 states and 33392 transitions. Word has length 64 [2019-12-18 12:55:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:27,639 INFO L462 AbstractCegarLoop]: Abstraction has 10671 states and 33392 transitions. [2019-12-18 12:55:27,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10671 states and 33392 transitions. [2019-12-18 12:55:27,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:27,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:27,657 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 12:55:27,657 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 12:55:27,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:27,658 INFO L82 PathProgramCache]: Analyzing trace with hash -612356637, now seen corresponding path program 4 times [2019-12-18 12:55:27,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:27,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324205277] [2019-12-18 12:55:27,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:27,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324205277] [2019-12-18 12:55:27,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:27,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:27,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477375388] [2019-12-18 12:55:27,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:27,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:27,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:27,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:27,766 INFO L87 Difference]: Start difference. First operand 10671 states and 33392 transitions. Second operand 9 states. [2019-12-18 12:55:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:28,821 INFO L93 Difference]: Finished difference Result 28791 states and 88355 transitions. [2019-12-18 12:55:28,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:55:28,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:55:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:28,856 INFO L225 Difference]: With dead ends: 28791 [2019-12-18 12:55:28,857 INFO L226 Difference]: Without dead ends: 26476 [2019-12-18 12:55:28,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:55:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26476 states. [2019-12-18 12:55:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26476 to 10699. [2019-12-18 12:55:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10699 states. [2019-12-18 12:55:29,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10699 states to 10699 states and 33546 transitions. [2019-12-18 12:55:29,125 INFO L78 Accepts]: Start accepts. Automaton has 10699 states and 33546 transitions. Word has length 64 [2019-12-18 12:55:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:29,125 INFO L462 AbstractCegarLoop]: Abstraction has 10699 states and 33546 transitions. [2019-12-18 12:55:29,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 10699 states and 33546 transitions. [2019-12-18 12:55:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:55:29,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:29,136 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 12:55:29,136 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 12:55:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 5 times [2019-12-18 12:55:29,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:29,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881159496] [2019-12-18 12:55:29,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:29,201 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 12:55:29,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881159496] [2019-12-18 12:55:29,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:29,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:29,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972922700] [2019-12-18 12:55:29,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:29,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:29,203 INFO L87 Difference]: Start difference. First operand 10699 states and 33546 transitions. Second operand 3 states. [2019-12-18 12:55:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:29,307 INFO L93 Difference]: Finished difference Result 12415 states and 38850 transitions. [2019-12-18 12:55:29,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:29,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:55:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:29,326 INFO L225 Difference]: With dead ends: 12415 [2019-12-18 12:55:29,326 INFO L226 Difference]: Without dead ends: 12415 [2019-12-18 12:55:29,327 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 12:55:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12415 states. [2019-12-18 12:55:29,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12415 to 11167. [2019-12-18 12:55:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11167 states. [2019-12-18 12:55:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11167 states to 11167 states and 35106 transitions. [2019-12-18 12:55:29,522 INFO L78 Accepts]: Start accepts. Automaton has 11167 states and 35106 transitions. Word has length 64 [2019-12-18 12:55:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:29,523 INFO L462 AbstractCegarLoop]: Abstraction has 11167 states and 35106 transitions. [2019-12-18 12:55:29,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 11167 states and 35106 transitions. [2019-12-18 12:55:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:55:29,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:29,536 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 12:55:29,537 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 12:55:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:29,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1436762006, now seen corresponding path program 1 times [2019-12-18 12:55:29,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:29,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626996338] [2019-12-18 12:55:29,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:29,648 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 12:55:29,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626996338] [2019-12-18 12:55:29,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:29,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:29,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416804112] [2019-12-18 12:55:29,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:29,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:29,650 INFO L87 Difference]: Start difference. First operand 11167 states and 35106 transitions. Second operand 9 states. [2019-12-18 12:55:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:30,547 INFO L93 Difference]: Finished difference Result 24122 states and 73292 transitions. [2019-12-18 12:55:30,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:55:30,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:55:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:30,582 INFO L225 Difference]: With dead ends: 24122 [2019-12-18 12:55:30,583 INFO L226 Difference]: Without dead ends: 21209 [2019-12-18 12:55:30,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:55:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21209 states. [2019-12-18 12:55:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21209 to 10873. [2019-12-18 12:55:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10873 states. [2019-12-18 12:55:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10873 states to 10873 states and 34055 transitions. [2019-12-18 12:55:30,833 INFO L78 Accepts]: Start accepts. Automaton has 10873 states and 34055 transitions. Word has length 65 [2019-12-18 12:55:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:30,833 INFO L462 AbstractCegarLoop]: Abstraction has 10873 states and 34055 transitions. [2019-12-18 12:55:30,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10873 states and 34055 transitions. [2019-12-18 12:55:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:55:30,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:30,848 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 12:55:30,848 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 12:55:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash 191844726, now seen corresponding path program 2 times [2019-12-18 12:55:30,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:30,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948774839] [2019-12-18 12:55:30,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:30,973 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 12:55:30,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948774839] [2019-12-18 12:55:30,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:30,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:30,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740151915] [2019-12-18 12:55:30,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:30,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:30,975 INFO L87 Difference]: Start difference. First operand 10873 states and 34055 transitions. Second operand 9 states. [2019-12-18 12:55:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:31,887 INFO L93 Difference]: Finished difference Result 25466 states and 77294 transitions. [2019-12-18 12:55:31,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:55:31,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:55:31,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:31,918 INFO L225 Difference]: With dead ends: 25466 [2019-12-18 12:55:31,918 INFO L226 Difference]: Without dead ends: 22576 [2019-12-18 12:55:31,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:55:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22576 states. [2019-12-18 12:55:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22576 to 10803. [2019-12-18 12:55:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10803 states. [2019-12-18 12:55:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10803 states to 10803 states and 33722 transitions. [2019-12-18 12:55:32,172 INFO L78 Accepts]: Start accepts. Automaton has 10803 states and 33722 transitions. Word has length 65 [2019-12-18 12:55:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:32,172 INFO L462 AbstractCegarLoop]: Abstraction has 10803 states and 33722 transitions. [2019-12-18 12:55:32,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 10803 states and 33722 transitions. [2019-12-18 12:55:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:55:32,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:32,183 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 12:55:32,183 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 12:55:32,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:32,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1224133449, now seen corresponding path program 1 times [2019-12-18 12:55:32,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:32,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915004486] [2019-12-18 12:55:32,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:32,244 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 12:55:32,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915004486] [2019-12-18 12:55:32,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:32,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:32,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596605380] [2019-12-18 12:55:32,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:32,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:32,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:32,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:32,246 INFO L87 Difference]: Start difference. First operand 10803 states and 33722 transitions. Second operand 3 states. [2019-12-18 12:55:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:32,290 INFO L93 Difference]: Finished difference Result 8980 states and 27417 transitions. [2019-12-18 12:55:32,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:32,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:55:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:32,306 INFO L225 Difference]: With dead ends: 8980 [2019-12-18 12:55:32,306 INFO L226 Difference]: Without dead ends: 8980 [2019-12-18 12:55:32,306 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 12:55:32,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8980 states. [2019-12-18 12:55:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8980 to 8980. [2019-12-18 12:55:32,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8980 states. [2019-12-18 12:55:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8980 states to 8980 states and 27417 transitions. [2019-12-18 12:55:32,685 INFO L78 Accepts]: Start accepts. Automaton has 8980 states and 27417 transitions. Word has length 65 [2019-12-18 12:55:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:32,686 INFO L462 AbstractCegarLoop]: Abstraction has 8980 states and 27417 transitions. [2019-12-18 12:55:32,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:32,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8980 states and 27417 transitions. [2019-12-18 12:55:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:32,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:32,705 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 12:55:32,705 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 12:55:32,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1594529229, now seen corresponding path program 1 times [2019-12-18 12:55:32,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:32,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435538297] [2019-12-18 12:55:32,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:32,860 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 12:55:32,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435538297] [2019-12-18 12:55:32,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:32,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:55:32,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033587344] [2019-12-18 12:55:32,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:55:32,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:32,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:55:32,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:55:32,868 INFO L87 Difference]: Start difference. First operand 8980 states and 27417 transitions. Second operand 8 states. [2019-12-18 12:55:33,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:33,680 INFO L93 Difference]: Finished difference Result 15994 states and 48223 transitions. [2019-12-18 12:55:33,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 12:55:33,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:55:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:33,698 INFO L225 Difference]: With dead ends: 15994 [2019-12-18 12:55:33,699 INFO L226 Difference]: Without dead ends: 12031 [2019-12-18 12:55:33,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:55:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12031 states. [2019-12-18 12:55:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12031 to 9444. [2019-12-18 12:55:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2019-12-18 12:55:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 28570 transitions. [2019-12-18 12:55:33,860 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 28570 transitions. Word has length 66 [2019-12-18 12:55:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:33,860 INFO L462 AbstractCegarLoop]: Abstraction has 9444 states and 28570 transitions. [2019-12-18 12:55:33,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:55:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 28570 transitions. [2019-12-18 12:55:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:33,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:33,870 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 12:55:33,870 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 12:55:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1923158013, now seen corresponding path program 2 times [2019-12-18 12:55:33,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:33,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865689765] [2019-12-18 12:55:33,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:33,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865689765] [2019-12-18 12:55:33,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:33,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:33,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355170459] [2019-12-18 12:55:33,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:55:33,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:33,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:55:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:55:33,983 INFO L87 Difference]: Start difference. First operand 9444 states and 28570 transitions. Second operand 9 states. [2019-12-18 12:55:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:34,844 INFO L93 Difference]: Finished difference Result 15258 states and 45563 transitions. [2019-12-18 12:55:34,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:55:34,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:55:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:34,872 INFO L225 Difference]: With dead ends: 15258 [2019-12-18 12:55:34,872 INFO L226 Difference]: Without dead ends: 11711 [2019-12-18 12:55:34,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:55:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11711 states. [2019-12-18 12:55:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11711 to 9284. [2019-12-18 12:55:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9284 states. [2019-12-18 12:55:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9284 states to 9284 states and 28042 transitions. [2019-12-18 12:55:35,193 INFO L78 Accepts]: Start accepts. Automaton has 9284 states and 28042 transitions. Word has length 66 [2019-12-18 12:55:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:35,194 INFO L462 AbstractCegarLoop]: Abstraction has 9284 states and 28042 transitions. [2019-12-18 12:55:35,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:55:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9284 states and 28042 transitions. [2019-12-18 12:55:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:35,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:35,210 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 12:55:35,210 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 12:55:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:35,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1918437107, now seen corresponding path program 3 times [2019-12-18 12:55:35,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:35,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170431937] [2019-12-18 12:55:35,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:55:35,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170431937] [2019-12-18 12:55:35,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:35,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:35,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461542252] [2019-12-18 12:55:35,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:55:35,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:35,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:55:35,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:55:35,371 INFO L87 Difference]: Start difference. First operand 9284 states and 28042 transitions. Second operand 10 states. [2019-12-18 12:55:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:36,064 INFO L93 Difference]: Finished difference Result 15421 states and 45863 transitions. [2019-12-18 12:55:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:55:36,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:55:36,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:36,081 INFO L225 Difference]: With dead ends: 15421 [2019-12-18 12:55:36,081 INFO L226 Difference]: Without dead ends: 12182 [2019-12-18 12:55:36,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:55:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12182 states. [2019-12-18 12:55:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12182 to 9324. [2019-12-18 12:55:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9324 states. [2019-12-18 12:55:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9324 states to 9324 states and 28092 transitions. [2019-12-18 12:55:36,250 INFO L78 Accepts]: Start accepts. Automaton has 9324 states and 28092 transitions. Word has length 66 [2019-12-18 12:55:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:36,251 INFO L462 AbstractCegarLoop]: Abstraction has 9324 states and 28092 transitions. [2019-12-18 12:55:36,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:55:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 9324 states and 28092 transitions. [2019-12-18 12:55:36,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:36,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:36,260 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 12:55:36,260 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 12:55:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:36,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1375937223, now seen corresponding path program 4 times [2019-12-18 12:55:36,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:36,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840725703] [2019-12-18 12:55:36,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:36,417 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 12:55:36,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840725703] [2019-12-18 12:55:36,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:36,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:55:36,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041509000] [2019-12-18 12:55:36,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:55:36,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:55:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:55:36,419 INFO L87 Difference]: Start difference. First operand 9324 states and 28092 transitions. Second operand 11 states. [2019-12-18 12:55:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:37,164 INFO L93 Difference]: Finished difference Result 14541 states and 43211 transitions. [2019-12-18 12:55:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:55:37,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:55:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:37,181 INFO L225 Difference]: With dead ends: 14541 [2019-12-18 12:55:37,181 INFO L226 Difference]: Without dead ends: 11402 [2019-12-18 12:55:37,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:55:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11402 states. [2019-12-18 12:55:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11402 to 9020. [2019-12-18 12:55:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9020 states. [2019-12-18 12:55:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 27190 transitions. [2019-12-18 12:55:37,336 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 27190 transitions. Word has length 66 [2019-12-18 12:55:37,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:37,336 INFO L462 AbstractCegarLoop]: Abstraction has 9020 states and 27190 transitions. [2019-12-18 12:55:37,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:55:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 27190 transitions. [2019-12-18 12:55:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:37,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:37,346 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 12:55:37,346 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 12:55:37,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash -754962803, now seen corresponding path program 5 times [2019-12-18 12:55:37,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:37,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312314546] [2019-12-18 12:55:37,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:37,592 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 12:55:37,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312314546] [2019-12-18 12:55:37,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:37,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:55:37,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676824560] [2019-12-18 12:55:37,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:55:37,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:37,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:55:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:55:37,594 INFO L87 Difference]: Start difference. First operand 9020 states and 27190 transitions. Second operand 12 states. [2019-12-18 12:55:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:38,331 INFO L93 Difference]: Finished difference Result 11597 states and 34468 transitions. [2019-12-18 12:55:38,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:55:38,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:55:38,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:38,347 INFO L225 Difference]: With dead ends: 11597 [2019-12-18 12:55:38,348 INFO L226 Difference]: Without dead ends: 11370 [2019-12-18 12:55:38,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 12:55:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11370 states. [2019-12-18 12:55:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11370 to 8844. [2019-12-18 12:55:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-12-18 12:55:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 26706 transitions. [2019-12-18 12:55:38,504 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 26706 transitions. Word has length 66 [2019-12-18 12:55:38,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:38,504 INFO L462 AbstractCegarLoop]: Abstraction has 8844 states and 26706 transitions. [2019-12-18 12:55:38,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:55:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 26706 transitions. [2019-12-18 12:55:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:38,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:38,513 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 12:55:38,513 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 12:55:38,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:38,513 INFO L82 PathProgramCache]: Analyzing trace with hash 184937189, now seen corresponding path program 6 times [2019-12-18 12:55:38,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:38,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958179646] [2019-12-18 12:55:38,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:38,716 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 12:55:38,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958179646] [2019-12-18 12:55:38,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:38,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:55:38,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908777420] [2019-12-18 12:55:38,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:55:38,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:55:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:55:38,719 INFO L87 Difference]: Start difference. First operand 8844 states and 26706 transitions. Second operand 11 states. [2019-12-18 12:55:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:40,367 INFO L93 Difference]: Finished difference Result 18875 states and 55391 transitions. [2019-12-18 12:55:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:55:40,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:55:40,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:40,393 INFO L225 Difference]: With dead ends: 18875 [2019-12-18 12:55:40,394 INFO L226 Difference]: Without dead ends: 18611 [2019-12-18 12:55:40,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:55:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18611 states. [2019-12-18 12:55:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18611 to 13800. [2019-12-18 12:55:40,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13800 states. [2019-12-18 12:55:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13800 states to 13800 states and 40722 transitions. [2019-12-18 12:55:40,638 INFO L78 Accepts]: Start accepts. Automaton has 13800 states and 40722 transitions. Word has length 66 [2019-12-18 12:55:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:40,638 INFO L462 AbstractCegarLoop]: Abstraction has 13800 states and 40722 transitions. [2019-12-18 12:55:40,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:55:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 13800 states and 40722 transitions. [2019-12-18 12:55:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:40,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:40,652 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 12:55:40,652 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 12:55:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:40,653 INFO L82 PathProgramCache]: Analyzing trace with hash -658262819, now seen corresponding path program 7 times [2019-12-18 12:55:40,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:40,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803176413] [2019-12-18 12:55:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:40,773 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 12:55:40,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803176413] [2019-12-18 12:55:40,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:40,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:55:40,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764072259] [2019-12-18 12:55:40,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:55:40,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:40,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:55:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:55:40,775 INFO L87 Difference]: Start difference. First operand 13800 states and 40722 transitions. Second operand 8 states. [2019-12-18 12:55:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:41,887 INFO L93 Difference]: Finished difference Result 25858 states and 74331 transitions. [2019-12-18 12:55:41,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:55:41,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:55:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:41,920 INFO L225 Difference]: With dead ends: 25858 [2019-12-18 12:55:41,920 INFO L226 Difference]: Without dead ends: 25690 [2019-12-18 12:55:41,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:55:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25690 states. [2019-12-18 12:55:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25690 to 17013. [2019-12-18 12:55:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17013 states. [2019-12-18 12:55:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17013 states to 17013 states and 49904 transitions. [2019-12-18 12:55:42,232 INFO L78 Accepts]: Start accepts. Automaton has 17013 states and 49904 transitions. Word has length 66 [2019-12-18 12:55:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:42,232 INFO L462 AbstractCegarLoop]: Abstraction has 17013 states and 49904 transitions. [2019-12-18 12:55:42,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:55:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17013 states and 49904 transitions. [2019-12-18 12:55:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:42,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:42,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:42,249 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 12:55:42,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1968796731, now seen corresponding path program 8 times [2019-12-18 12:55:42,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:42,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60424682] [2019-12-18 12:55:42,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:42,520 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 12:55:42,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60424682] [2019-12-18 12:55:42,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:42,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:55:42,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876616200] [2019-12-18 12:55:42,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:55:42,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:42,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:55:42,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:55:42,522 INFO L87 Difference]: Start difference. First operand 17013 states and 49904 transitions. Second operand 14 states. [2019-12-18 12:55:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:44,618 INFO L93 Difference]: Finished difference Result 26549 states and 76691 transitions. [2019-12-18 12:55:44,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:55:44,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-18 12:55:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:44,652 INFO L225 Difference]: With dead ends: 26549 [2019-12-18 12:55:44,652 INFO L226 Difference]: Without dead ends: 26549 [2019-12-18 12:55:44,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:55:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26549 states. [2019-12-18 12:55:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26549 to 17073. [2019-12-18 12:55:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17073 states. [2019-12-18 12:55:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17073 states to 17073 states and 50074 transitions. [2019-12-18 12:55:44,976 INFO L78 Accepts]: Start accepts. Automaton has 17073 states and 50074 transitions. Word has length 66 [2019-12-18 12:55:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:44,977 INFO L462 AbstractCegarLoop]: Abstraction has 17073 states and 50074 transitions. [2019-12-18 12:55:44,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:55:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 17073 states and 50074 transitions. [2019-12-18 12:55:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:44,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:44,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:44,996 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 12:55:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1206613304, now seen corresponding path program 1 times [2019-12-18 12:55:44,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:44,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430130945] [2019-12-18 12:55:44,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:45,150 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 12:55:45,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430130945] [2019-12-18 12:55:45,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:45,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:55:45,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021343030] [2019-12-18 12:55:45,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:55:45,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:45,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:55:45,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:55:45,152 INFO L87 Difference]: Start difference. First operand 17073 states and 50074 transitions. Second operand 11 states. [2019-12-18 12:55:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:46,671 INFO L93 Difference]: Finished difference Result 23931 states and 69189 transitions. [2019-12-18 12:55:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:55:46,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:55:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:46,703 INFO L225 Difference]: With dead ends: 23931 [2019-12-18 12:55:46,703 INFO L226 Difference]: Without dead ends: 23931 [2019-12-18 12:55:46,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:55:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23931 states. [2019-12-18 12:55:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23931 to 17367. [2019-12-18 12:55:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17367 states. [2019-12-18 12:55:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17367 states to 17367 states and 50853 transitions. [2019-12-18 12:55:47,019 INFO L78 Accepts]: Start accepts. Automaton has 17367 states and 50853 transitions. Word has length 66 [2019-12-18 12:55:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:47,019 INFO L462 AbstractCegarLoop]: Abstraction has 17367 states and 50853 transitions. [2019-12-18 12:55:47,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:55:47,020 INFO L276 IsEmpty]: Start isEmpty. Operand 17367 states and 50853 transitions. [2019-12-18 12:55:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:47,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:47,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:55:47,038 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 12:55:47,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:47,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1326542277, now seen corresponding path program 9 times [2019-12-18 12:55:47,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:47,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122795869] [2019-12-18 12:55:47,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:47,429 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 12:55:47,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122795869] [2019-12-18 12:55:47,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:47,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:55:47,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495978676] [2019-12-18 12:55:47,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 12:55:47,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:47,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 12:55:47,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:55:47,431 INFO L87 Difference]: Start difference. First operand 17367 states and 50853 transitions. Second operand 14 states. [2019-12-18 12:55:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:49,860 INFO L93 Difference]: Finished difference Result 27269 states and 78563 transitions. [2019-12-18 12:55:49,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:55:49,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-18 12:55:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:49,895 INFO L225 Difference]: With dead ends: 27269 [2019-12-18 12:55:49,895 INFO L226 Difference]: Without dead ends: 27269 [2019-12-18 12:55:49,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:55:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27269 states. [2019-12-18 12:55:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27269 to 17067. [2019-12-18 12:55:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17067 states. [2019-12-18 12:55:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17067 states to 17067 states and 50015 transitions. [2019-12-18 12:55:50,335 INFO L78 Accepts]: Start accepts. Automaton has 17067 states and 50015 transitions. Word has length 66 [2019-12-18 12:55:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:50,335 INFO L462 AbstractCegarLoop]: Abstraction has 17067 states and 50015 transitions. [2019-12-18 12:55:50,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 12:55:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17067 states and 50015 transitions. [2019-12-18 12:55:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:55:50,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:50,352 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 12:55:50,353 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 12:55:50,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash 131851315, now seen corresponding path program 10 times [2019-12-18 12:55:50,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:50,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588005531] [2019-12-18 12:55:50,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:55:50,421 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 12:55:50,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588005531] [2019-12-18 12:55:50,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:55:50,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:55:50,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33113421] [2019-12-18 12:55:50,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:55:50,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:55:50,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:55:50,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:55:50,423 INFO L87 Difference]: Start difference. First operand 17067 states and 50015 transitions. Second operand 3 states. [2019-12-18 12:55:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:55:50,497 INFO L93 Difference]: Finished difference Result 17067 states and 50014 transitions. [2019-12-18 12:55:50,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:55:50,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:55:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:55:50,527 INFO L225 Difference]: With dead ends: 17067 [2019-12-18 12:55:50,527 INFO L226 Difference]: Without dead ends: 17067 [2019-12-18 12:55:50,527 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 12:55:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17067 states. [2019-12-18 12:55:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17067 to 13041. [2019-12-18 12:55:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13041 states. [2019-12-18 12:55:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13041 states to 13041 states and 38814 transitions. [2019-12-18 12:55:50,936 INFO L78 Accepts]: Start accepts. Automaton has 13041 states and 38814 transitions. Word has length 66 [2019-12-18 12:55:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:55:50,936 INFO L462 AbstractCegarLoop]: Abstraction has 13041 states and 38814 transitions. [2019-12-18 12:55:50,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:55:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 13041 states and 38814 transitions. [2019-12-18 12:55:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:55:50,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:55:50,956 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 12:55:50,956 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 12:55:50,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:55:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 1 times [2019-12-18 12:55:50,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:55:50,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295513290] [2019-12-18 12:55:50,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:55:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:55:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:55:51,124 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:55:51,124 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:55:51,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (< 0 |v_#StackHeapBarrier_17|) (= |v_ULTIMATE.start_main_~#t645~0.offset_19| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t645~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t645~0.base_24|) |v_ULTIMATE.start_main_~#t645~0.offset_19| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t645~0.base_24| 1) |v_#valid_63|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t645~0.base_24|) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t645~0.base_24| 4)) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t645~0.base_24|)) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t645~0.offset=|v_ULTIMATE.start_main_~#t645~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ULTIMATE.start_main_~#t647~0.base=|v_ULTIMATE.start_main_~#t647~0.base_27|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ULTIMATE.start_main_~#t646~0.offset=|v_ULTIMATE.start_main_~#t646~0.offset_19|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ULTIMATE.start_main_~#t647~0.offset=|v_ULTIMATE.start_main_~#t647~0.offset_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ULTIMATE.start_main_~#t646~0.base=|v_ULTIMATE.start_main_~#t646~0.base_26|, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ULTIMATE.start_main_~#t645~0.base=|v_ULTIMATE.start_main_~#t645~0.base_24|, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ~y~0=v_~y~0_39, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t645~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t647~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t646~0.offset, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t647~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t646~0.base, ~x~0, ~a$read_delayed~0, ULTIMATE.start_main_~#t645~0.base, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-18 12:55:51,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t646~0.base_10| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t646~0.base_10| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t646~0.base_10|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t646~0.base_10|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t646~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t646~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t646~0.base_10|) |v_ULTIMATE.start_main_~#t646~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t646~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t646~0.offset=|v_ULTIMATE.start_main_~#t646~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t646~0.base=|v_ULTIMATE.start_main_~#t646~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t646~0.offset, #length, ULTIMATE.start_main_~#t646~0.base] because there is no mapped edge [2019-12-18 12:55:51,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t647~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t647~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t647~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t647~0.base_13|) |v_ULTIMATE.start_main_~#t647~0.offset_11| 2)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t647~0.base_13| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t647~0.base_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t647~0.base_13|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t647~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t647~0.base=|v_ULTIMATE.start_main_~#t647~0.base_13|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t647~0.offset=|v_ULTIMATE.start_main_~#t647~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t647~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t647~0.offset, #length] because there is no mapped edge [2019-12-18 12:55:51,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:55:51,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In1343491503 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1343491503 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1343491503| ~a~0_In1343491503) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1343491503| ~a$w_buff1~0_In1343491503)))) InVars {~a~0=~a~0_In1343491503, ~a$w_buff1~0=~a$w_buff1~0_In1343491503, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1343491503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1343491503} OutVars{~a~0=~a~0_In1343491503, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1343491503|, ~a$w_buff1~0=~a$w_buff1~0_In1343491503, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1343491503, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1343491503} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:55:51,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1696905692 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1696905692 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1696905692 |P0Thread1of1ForFork1_#t~ite5_Out1696905692|)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1696905692| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1696905692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1696905692} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1696905692|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1696905692, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1696905692} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:55:51,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In1975236520 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In1975236520 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In1975236520 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd1~0_In1975236520 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out1975236520| ~a$w_buff1_used~0_In1975236520) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1975236520| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1975236520, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1975236520, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1975236520, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1975236520} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1975236520|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1975236520, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1975236520, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1975236520, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1975236520} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:55:51,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1932267190 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1932267190 256)))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out1932267190) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd1~0_Out1932267190 ~a$r_buff0_thd1~0_In1932267190)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1932267190, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1932267190} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1932267190|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1932267190, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1932267190} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:55:51,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1358493813 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1358493813 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1358493813 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In1358493813 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1358493813| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out1358493813| ~a$r_buff1_thd1~0_In1358493813) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1358493813, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1358493813, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1358493813, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1358493813} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1358493813|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1358493813, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1358493813, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1358493813, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1358493813} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:55:51,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:55:51,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1111974748 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out1111974748| ~a$w_buff0~0_In1111974748) (= |P2Thread1of1ForFork0_#t~ite20_Out1111974748| |P2Thread1of1ForFork0_#t~ite21_Out1111974748|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1111974748 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In1111974748 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In1111974748 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In1111974748 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite21_Out1111974748| ~a$w_buff0~0_In1111974748) (= |P2Thread1of1ForFork0_#t~ite20_In1111974748| |P2Thread1of1ForFork0_#t~ite20_Out1111974748|) (not .cse0)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1111974748, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1111974748, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1111974748, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1111974748, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1111974748, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1111974748|, ~weak$$choice2~0=~weak$$choice2~0_In1111974748} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1111974748|, ~a$w_buff0~0=~a$w_buff0~0_In1111974748, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1111974748, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1111974748, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1111974748, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1111974748|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1111974748, ~weak$$choice2~0=~weak$$choice2~0_In1111974748} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:55:51,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In771297754 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out771297754| ~a$w_buff0_used~0_In771297754) (= |P2Thread1of1ForFork0_#t~ite26_In771297754| |P2Thread1of1ForFork0_#t~ite26_Out771297754|)) (and (= |P2Thread1of1ForFork0_#t~ite26_Out771297754| ~a$w_buff0_used~0_In771297754) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In771297754 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In771297754 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In771297754 256) 0) (and (= (mod ~a$r_buff1_thd3~0_In771297754 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out771297754| |P2Thread1of1ForFork0_#t~ite26_Out771297754|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In771297754|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In771297754, ~a$w_buff0_used~0=~a$w_buff0_used~0_In771297754, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In771297754, ~a$w_buff1_used~0=~a$w_buff1_used~0_In771297754, ~weak$$choice2~0=~weak$$choice2~0_In771297754} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out771297754|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out771297754|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In771297754, ~a$w_buff0_used~0=~a$w_buff0_used~0_In771297754, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In771297754, ~a$w_buff1_used~0=~a$w_buff1_used~0_In771297754, ~weak$$choice2~0=~weak$$choice2~0_In771297754} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:55:51,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1166115743 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In-1166115743| |P2Thread1of1ForFork0_#t~ite29_Out-1166115743|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out-1166115743| ~a$w_buff1_used~0_In-1166115743)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1166115743 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1166115743 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-1166115743 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1166115743 256) 0)))) .cse0 (= ~a$w_buff1_used~0_In-1166115743 |P2Thread1of1ForFork0_#t~ite29_Out-1166115743|) (= |P2Thread1of1ForFork0_#t~ite30_Out-1166115743| |P2Thread1of1ForFork0_#t~ite29_Out-1166115743|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1166115743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1166115743, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1166115743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1166115743, ~weak$$choice2~0=~weak$$choice2~0_In-1166115743, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1166115743|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1166115743, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1166115743, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1166115743, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1166115743|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1166115743, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1166115743|, ~weak$$choice2~0=~weak$$choice2~0_In-1166115743} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:55:51,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:55:51,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:55:51,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In864601322 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In864601322 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In864601322 |P1Thread1of1ForFork2_#t~ite11_Out864601322|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out864601322|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In864601322, ~a$w_buff0_used~0=~a$w_buff0_used~0_In864601322} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In864601322, ~a$w_buff0_used~0=~a$w_buff0_used~0_In864601322, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out864601322|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:55:51,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-1206074332 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1206074332 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1206074332 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1206074332 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1206074332| ~a$w_buff1_used~0_In-1206074332) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1206074332|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1206074332, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1206074332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206074332, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1206074332} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1206074332, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1206074332, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1206074332, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1206074332|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1206074332} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:55:51,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-194968263 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-194968263 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In-194968263 |P1Thread1of1ForFork2_#t~ite13_Out-194968263|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-194968263|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-194968263, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-194968263} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-194968263, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-194968263, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-194968263|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:55:51,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-625162343 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-625162343 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-625162343 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-625162343 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-625162343| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-625162343| ~a$r_buff1_thd2~0_In-625162343) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-625162343, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-625162343, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-625162343, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-625162343} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-625162343, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-625162343, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-625162343, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-625162343, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-625162343|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:55:51,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:55:51,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 12:55:51,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-248090986 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-248090986 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-248090986| |P2Thread1of1ForFork0_#t~ite39_Out-248090986|))) (or (and (= ~a$w_buff1~0_In-248090986 |P2Thread1of1ForFork0_#t~ite38_Out-248090986|) (not .cse0) (not .cse1) .cse2) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-248090986| ~a~0_In-248090986) .cse2))) InVars {~a~0=~a~0_In-248090986, ~a$w_buff1~0=~a$w_buff1~0_In-248090986, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-248090986, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-248090986} OutVars{~a~0=~a~0_In-248090986, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-248090986|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-248090986|, ~a$w_buff1~0=~a$w_buff1~0_In-248090986, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-248090986, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-248090986} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:55:51,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-959969101 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-959969101 256)))) (or (and (= ~a$w_buff0_used~0_In-959969101 |P2Thread1of1ForFork0_#t~ite40_Out-959969101|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-959969101| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-959969101, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-959969101} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-959969101|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-959969101, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-959969101} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:55:51,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1701016490 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1701016490 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-1701016490 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In-1701016490 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1701016490| ~a$w_buff1_used~0_In-1701016490)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1701016490| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1701016490, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1701016490, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1701016490, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1701016490} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1701016490, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1701016490, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1701016490, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1701016490, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1701016490|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:55:51,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-859480999 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-859480999 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-859480999| ~a$r_buff0_thd3~0_In-859480999) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-859480999| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-859480999, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-859480999} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-859480999, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-859480999, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-859480999|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:55:51,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In-2078758206 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-2078758206 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2078758206 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-2078758206 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-2078758206| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-2078758206 |P2Thread1of1ForFork0_#t~ite43_Out-2078758206|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2078758206, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2078758206, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2078758206, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2078758206} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-2078758206|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2078758206, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2078758206, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2078758206, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2078758206} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:55:51,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:55:51,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:55:51,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In2118081964 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In2118081964 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out2118081964| |ULTIMATE.start_main_#t~ite48_Out2118081964|))) (or (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In2118081964 |ULTIMATE.start_main_#t~ite47_Out2118081964|) .cse2) (and (= |ULTIMATE.start_main_#t~ite47_Out2118081964| ~a~0_In2118081964) (or .cse1 .cse0) .cse2))) InVars {~a~0=~a~0_In2118081964, ~a$w_buff1~0=~a$w_buff1~0_In2118081964, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2118081964, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2118081964} OutVars{~a~0=~a~0_In2118081964, ~a$w_buff1~0=~a$w_buff1~0_In2118081964, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2118081964|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2118081964, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out2118081964|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2118081964} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:55:51,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In344269919 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In344269919 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out344269919| ~a$w_buff0_used~0_In344269919)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out344269919|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In344269919, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In344269919} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In344269919, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out344269919|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In344269919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:55:51,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In602750681 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In602750681 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In602750681 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In602750681 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out602750681|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In602750681 |ULTIMATE.start_main_#t~ite50_Out602750681|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In602750681, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602750681, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In602750681, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602750681} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out602750681|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In602750681, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602750681, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In602750681, ~a$w_buff1_used~0=~a$w_buff1_used~0_In602750681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:55:51,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1457778573 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1457778573 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1457778573| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-1457778573 |ULTIMATE.start_main_#t~ite51_Out-1457778573|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1457778573, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1457778573} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1457778573|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1457778573, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1457778573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:55:51,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-1771647901 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1771647901 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1771647901 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd0~0_In-1771647901 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1771647901| ~a$r_buff1_thd0~0_In-1771647901) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1771647901|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1771647901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1771647901, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1771647901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1771647901} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1771647901|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1771647901, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1771647901, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1771647901, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1771647901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:55:51,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:55:51,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:55:51 BasicIcfg [2019-12-18 12:55:51,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:55:51,269 INFO L168 Benchmark]: Toolchain (without parser) took 98401.97 ms. Allocated memory was 138.4 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 102.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 890.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:51,274 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:55:51,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.42 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 156.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:51,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.76 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:51,275 INFO L168 Benchmark]: Boogie Preprocessor took 41.91 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:51,275 INFO L168 Benchmark]: RCFGBuilder took 850.57 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 100.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 12:55:51,276 INFO L168 Benchmark]: TraceAbstraction took 96642.36 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 823.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:55:51,278 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.56 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.42 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.6 MB in the beginning and 156.2 MB in the end (delta: -54.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.76 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.91 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 850.57 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 100.1 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96642.36 ms. Allocated memory was 202.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 99.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 823.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t645, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t646, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t647, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.2s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7144 SDtfs, 11556 SDslu, 25978 SDs, 0 SdLazy, 14926 SolverSat, 535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 80 SyntacticMatches, 20 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred 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: 33.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 179205 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1705 NumberOfCodeBlocks, 1705 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 376251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...