/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/mix003_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:07:09,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:07:09,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:07:09,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:07:09,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:07:09,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:07:09,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:07:09,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:07:09,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:07:09,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:07:09,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:07:09,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:07:09,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:07:09,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:07:09,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:07:09,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:07:09,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:07:09,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:07:09,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:07:09,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:07:09,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:07:09,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:07:09,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:07:09,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:07:09,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:07:09,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:07:09,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:07:09,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:07:09,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:07:09,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:07:09,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:07:09,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:07:09,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:07:09,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:07:09,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:07:09,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:07:09,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:07:09,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:07:09,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:07:09,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:07:09,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:07:09,620 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:07:09,634 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:07:09,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:07:09,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:07:09,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:07:09,636 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:07:09,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:07:09,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:07:09,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:07:09,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:07:09,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:07:09,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:07:09,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:07:09,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:07:09,638 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:07:09,638 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:07:09,639 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:07:09,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:07:09,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:07:09,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:07:09,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:07:09,640 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:07:09,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:07:09,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:07:09,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:07:09,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:07:09,641 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:07:09,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:07:09,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:07:09,641 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:07:09,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:07:09,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:07:09,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:07:09,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:07:09,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:07:09,985 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:07:09,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_pso.oepc.i [2019-12-18 12:07:10,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12e0a231/bf26b35b6197402aaf68466974afa7ac/FLAGbb1d84eef [2019-12-18 12:07:10,604 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:07:10,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_pso.oepc.i [2019-12-18 12:07:10,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12e0a231/bf26b35b6197402aaf68466974afa7ac/FLAGbb1d84eef [2019-12-18 12:07:10,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12e0a231/bf26b35b6197402aaf68466974afa7ac [2019-12-18 12:07:10,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:07:10,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:07:10,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:07:10,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:07:10,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:07:10,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:07:10" (1/1) ... [2019-12-18 12:07:10,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100a49f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:10, skipping insertion in model container [2019-12-18 12:07:10,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:07:10" (1/1) ... [2019-12-18 12:07:10,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:07:11,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:07:11,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:07:11,681 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:07:11,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:07:11,862 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:07:11,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11 WrapperNode [2019-12-18 12:07:11,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:07:11,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:07:11,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:07:11,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:07:11,871 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:07:11" (1/1) ... [2019-12-18 12:07:11,892 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:07:11" (1/1) ... [2019-12-18 12:07:11,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:07:11,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:07:11,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:07:11,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:07:11,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (1/1) ... [2019-12-18 12:07:11,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (1/1) ... [2019-12-18 12:07:11,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (1/1) ... [2019-12-18 12:07:11,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (1/1) ... [2019-12-18 12:07:11,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (1/1) ... [2019-12-18 12:07:11,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (1/1) ... [2019-12-18 12:07:11,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (1/1) ... [2019-12-18 12:07:11,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:07:11,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:07:11,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:07:11,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:07:11,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (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:07:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:07:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:07:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:07:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:07:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:07:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:07:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:07:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:07:12,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:07:12,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:07:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:07:12,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:07:12,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:07:12,050 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:07:12,826 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:07:12,827 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:07:12,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:07:12 BoogieIcfgContainer [2019-12-18 12:07:12,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:07:12,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:07:12,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:07:12,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:07:12,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:07:10" (1/3) ... [2019-12-18 12:07:12,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678eae46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:07:12, skipping insertion in model container [2019-12-18 12:07:12,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:07:11" (2/3) ... [2019-12-18 12:07:12,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678eae46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:07:12, skipping insertion in model container [2019-12-18 12:07:12,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:07:12" (3/3) ... [2019-12-18 12:07:12,837 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_pso.oepc.i [2019-12-18 12:07:12,847 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:07:12,848 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:07:12,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:07:12,856 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:07:12,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,902 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,908 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,932 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,932 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,966 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,999 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:12,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,001 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:07:13,035 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:07:13,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:07:13,056 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:07:13,056 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:07:13,056 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:07:13,056 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:07:13,056 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:07:13,056 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:07:13,056 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:07:13,073 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 12:07:13,075 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:07:13,168 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:07:13,168 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:07:13,190 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 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:07:13,219 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 12:07:13,271 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 12:07:13,272 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:07:13,281 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 439 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:07:13,303 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:07:13,304 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:07:18,578 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 12:07:18,711 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 12:07:19,063 INFO L206 etLargeBlockEncoding]: Checked pairs total: 132619 [2019-12-18 12:07:19,063 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 12:07:19,067 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 12:07:39,308 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120347 states. [2019-12-18 12:07:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 120347 states. [2019-12-18 12:07:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:07:39,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:39,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:07:39,318 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:07:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 919842, now seen corresponding path program 1 times [2019-12-18 12:07:39,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:39,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973760152] [2019-12-18 12:07:39,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:39,568 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:07:39,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973760152] [2019-12-18 12:07:39,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:39,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:07:39,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68354570] [2019-12-18 12:07:39,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:07:39,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:07:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:07:39,591 INFO L87 Difference]: Start difference. First operand 120347 states. Second operand 3 states. [2019-12-18 12:07:41,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:07:41,100 INFO L93 Difference]: Finished difference Result 119613 states and 515253 transitions. [2019-12-18 12:07:41,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:07:41,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:07:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:07:45,036 INFO L225 Difference]: With dead ends: 119613 [2019-12-18 12:07:45,037 INFO L226 Difference]: Without dead ends: 105755 [2019-12-18 12:07:45,038 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:07:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105755 states. [2019-12-18 12:07:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105755 to 105755. [2019-12-18 12:07:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105755 states. [2019-12-18 12:07:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105755 states to 105755 states and 454361 transitions. [2019-12-18 12:07:55,881 INFO L78 Accepts]: Start accepts. Automaton has 105755 states and 454361 transitions. Word has length 3 [2019-12-18 12:07:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:07:55,881 INFO L462 AbstractCegarLoop]: Abstraction has 105755 states and 454361 transitions. [2019-12-18 12:07:55,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:07:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 105755 states and 454361 transitions. [2019-12-18 12:07:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:07:55,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:07:55,886 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:07:55,886 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:07:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:07:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash 474732739, now seen corresponding path program 1 times [2019-12-18 12:07:55,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:07:55,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799930122] [2019-12-18 12:07:55,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:07:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:07:55,992 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:07:55,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799930122] [2019-12-18 12:07:55,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:07:55,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:07:55,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369101661] [2019-12-18 12:07:55,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:07:55,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:07:55,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:07:55,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:07:55,996 INFO L87 Difference]: Start difference. First operand 105755 states and 454361 transitions. Second operand 4 states. [2019-12-18 12:08:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:01,377 INFO L93 Difference]: Finished difference Result 168845 states and 694815 transitions. [2019-12-18 12:08:01,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:01,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:08:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:01,934 INFO L225 Difference]: With dead ends: 168845 [2019-12-18 12:08:01,934 INFO L226 Difference]: Without dead ends: 168747 [2019-12-18 12:08:01,935 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:08:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168747 states. [2019-12-18 12:08:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168747 to 153153. [2019-12-18 12:08:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153153 states. [2019-12-18 12:08:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153153 states to 153153 states and 639357 transitions. [2019-12-18 12:08:11,055 INFO L78 Accepts]: Start accepts. Automaton has 153153 states and 639357 transitions. Word has length 11 [2019-12-18 12:08:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:11,056 INFO L462 AbstractCegarLoop]: Abstraction has 153153 states and 639357 transitions. [2019-12-18 12:08:11,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 153153 states and 639357 transitions. [2019-12-18 12:08:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:08:11,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:11,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:11,064 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:08:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:11,065 INFO L82 PathProgramCache]: Analyzing trace with hash -512415605, now seen corresponding path program 1 times [2019-12-18 12:08:11,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:11,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751225955] [2019-12-18 12:08:11,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:11,138 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:08:11,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751225955] [2019-12-18 12:08:11,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:11,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:11,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113683124] [2019-12-18 12:08:11,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:11,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:11,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:11,140 INFO L87 Difference]: Start difference. First operand 153153 states and 639357 transitions. Second operand 3 states. [2019-12-18 12:08:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:11,267 INFO L93 Difference]: Finished difference Result 33476 states and 109893 transitions. [2019-12-18 12:08:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:11,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:08:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:11,326 INFO L225 Difference]: With dead ends: 33476 [2019-12-18 12:08:11,326 INFO L226 Difference]: Without dead ends: 33476 [2019-12-18 12:08:11,327 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:08:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33476 states. [2019-12-18 12:08:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33476 to 33476. [2019-12-18 12:08:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33476 states. [2019-12-18 12:08:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 109893 transitions. [2019-12-18 12:08:16,750 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 109893 transitions. Word has length 13 [2019-12-18 12:08:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:16,751 INFO L462 AbstractCegarLoop]: Abstraction has 33476 states and 109893 transitions. [2019-12-18 12:08:16,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 109893 transitions. [2019-12-18 12:08:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:08:16,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:16,755 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:08:16,755 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:08:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1719969010, now seen corresponding path program 1 times [2019-12-18 12:08:16,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:16,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361250591] [2019-12-18 12:08:16,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:16,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361250591] [2019-12-18 12:08:16,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:16,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:16,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418086173] [2019-12-18 12:08:16,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:16,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:16,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:16,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:16,826 INFO L87 Difference]: Start difference. First operand 33476 states and 109893 transitions. Second operand 4 states. [2019-12-18 12:08:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:17,183 INFO L93 Difference]: Finished difference Result 41508 states and 134890 transitions. [2019-12-18 12:08:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:17,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:08:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:17,249 INFO L225 Difference]: With dead ends: 41508 [2019-12-18 12:08:17,249 INFO L226 Difference]: Without dead ends: 41508 [2019-12-18 12:08:17,250 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:08:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41508 states. [2019-12-18 12:08:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41508 to 37458. [2019-12-18 12:08:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37458 states. [2019-12-18 12:08:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37458 states to 37458 states and 122375 transitions. [2019-12-18 12:08:18,245 INFO L78 Accepts]: Start accepts. Automaton has 37458 states and 122375 transitions. Word has length 16 [2019-12-18 12:08:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:18,246 INFO L462 AbstractCegarLoop]: Abstraction has 37458 states and 122375 transitions. [2019-12-18 12:08:18,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 37458 states and 122375 transitions. [2019-12-18 12:08:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:08:18,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:18,248 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:08:18,248 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:08:18,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1720071868, now seen corresponding path program 1 times [2019-12-18 12:08:18,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:18,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243483810] [2019-12-18 12:08:18,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:18,290 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:08:18,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243483810] [2019-12-18 12:08:18,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:18,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:18,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907993015] [2019-12-18 12:08:18,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:18,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:18,292 INFO L87 Difference]: Start difference. First operand 37458 states and 122375 transitions. Second operand 3 states. [2019-12-18 12:08:18,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:18,503 INFO L93 Difference]: Finished difference Result 54855 states and 178352 transitions. [2019-12-18 12:08:18,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:18,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:08:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:18,599 INFO L225 Difference]: With dead ends: 54855 [2019-12-18 12:08:18,599 INFO L226 Difference]: Without dead ends: 54855 [2019-12-18 12:08:18,600 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:08:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54855 states. [2019-12-18 12:08:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54855 to 41888. [2019-12-18 12:08:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41888 states. [2019-12-18 12:08:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41888 states to 41888 states and 137861 transitions. [2019-12-18 12:08:19,951 INFO L78 Accepts]: Start accepts. Automaton has 41888 states and 137861 transitions. Word has length 16 [2019-12-18 12:08:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:19,952 INFO L462 AbstractCegarLoop]: Abstraction has 41888 states and 137861 transitions. [2019-12-18 12:08:19,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 41888 states and 137861 transitions. [2019-12-18 12:08:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:08:19,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:19,955 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:08:19,956 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:08:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 759335912, now seen corresponding path program 1 times [2019-12-18 12:08:19,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:19,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83085548] [2019-12-18 12:08:19,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:20,027 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:08:20,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83085548] [2019-12-18 12:08:20,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:20,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:20,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727498800] [2019-12-18 12:08:20,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:20,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:20,030 INFO L87 Difference]: Start difference. First operand 41888 states and 137861 transitions. Second operand 4 states. [2019-12-18 12:08:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:20,430 INFO L93 Difference]: Finished difference Result 49903 states and 162773 transitions. [2019-12-18 12:08:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:20,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:08:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:20,517 INFO L225 Difference]: With dead ends: 49903 [2019-12-18 12:08:20,518 INFO L226 Difference]: Without dead ends: 49903 [2019-12-18 12:08:20,518 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:08:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49903 states. [2019-12-18 12:08:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49903 to 43402. [2019-12-18 12:08:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43402 states. [2019-12-18 12:08:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43402 states to 43402 states and 142861 transitions. [2019-12-18 12:08:21,286 INFO L78 Accepts]: Start accepts. Automaton has 43402 states and 142861 transitions. Word has length 16 [2019-12-18 12:08:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:21,286 INFO L462 AbstractCegarLoop]: Abstraction has 43402 states and 142861 transitions. [2019-12-18 12:08:21,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 43402 states and 142861 transitions. [2019-12-18 12:08:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:08:21,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:21,296 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:08:21,296 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:08:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:21,297 INFO L82 PathProgramCache]: Analyzing trace with hash -390431288, now seen corresponding path program 1 times [2019-12-18 12:08:21,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:21,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386730366] [2019-12-18 12:08:21,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:21,886 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 12:08:21,901 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:08:21,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386730366] [2019-12-18 12:08:21,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:21,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:21,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328849526] [2019-12-18 12:08:21,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:21,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:21,904 INFO L87 Difference]: Start difference. First operand 43402 states and 142861 transitions. Second operand 5 states. [2019-12-18 12:08:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:22,567 INFO L93 Difference]: Finished difference Result 59763 states and 191505 transitions. [2019-12-18 12:08:22,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:08:22,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:08:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:22,672 INFO L225 Difference]: With dead ends: 59763 [2019-12-18 12:08:22,672 INFO L226 Difference]: Without dead ends: 59749 [2019-12-18 12:08:22,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59749 states. [2019-12-18 12:08:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59749 to 44536. [2019-12-18 12:08:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44536 states. [2019-12-18 12:08:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44536 states to 44536 states and 146317 transitions. [2019-12-18 12:08:23,522 INFO L78 Accepts]: Start accepts. Automaton has 44536 states and 146317 transitions. Word has length 22 [2019-12-18 12:08:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:23,523 INFO L462 AbstractCegarLoop]: Abstraction has 44536 states and 146317 transitions. [2019-12-18 12:08:23,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 44536 states and 146317 transitions. [2019-12-18 12:08:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:08:23,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:23,532 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:08:23,532 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:08:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2088873634, now seen corresponding path program 1 times [2019-12-18 12:08:23,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:23,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985563035] [2019-12-18 12:08:23,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:23,608 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:08:23,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985563035] [2019-12-18 12:08:23,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:23,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:23,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33917502] [2019-12-18 12:08:23,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:23,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:23,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:23,610 INFO L87 Difference]: Start difference. First operand 44536 states and 146317 transitions. Second operand 5 states. [2019-12-18 12:08:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:24,593 INFO L93 Difference]: Finished difference Result 62779 states and 200555 transitions. [2019-12-18 12:08:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:08:24,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:08:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:24,698 INFO L225 Difference]: With dead ends: 62779 [2019-12-18 12:08:24,698 INFO L226 Difference]: Without dead ends: 62765 [2019-12-18 12:08:24,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62765 states. [2019-12-18 12:08:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62765 to 43009. [2019-12-18 12:08:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43009 states. [2019-12-18 12:08:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43009 states to 43009 states and 141377 transitions. [2019-12-18 12:08:25,531 INFO L78 Accepts]: Start accepts. Automaton has 43009 states and 141377 transitions. Word has length 22 [2019-12-18 12:08:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:25,531 INFO L462 AbstractCegarLoop]: Abstraction has 43009 states and 141377 transitions. [2019-12-18 12:08:25,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:25,531 INFO L276 IsEmpty]: Start isEmpty. Operand 43009 states and 141377 transitions. [2019-12-18 12:08:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:08:25,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:25,543 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:08:25,543 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:08:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -697105977, now seen corresponding path program 1 times [2019-12-18 12:08:25,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:25,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51474100] [2019-12-18 12:08:25,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:25,586 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:08:25,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51474100] [2019-12-18 12:08:25,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:25,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:25,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855853942] [2019-12-18 12:08:25,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:08:25,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:08:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:08:25,589 INFO L87 Difference]: Start difference. First operand 43009 states and 141377 transitions. Second operand 4 states. [2019-12-18 12:08:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:25,674 INFO L93 Difference]: Finished difference Result 17503 states and 54477 transitions. [2019-12-18 12:08:25,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:08:25,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:08:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:25,702 INFO L225 Difference]: With dead ends: 17503 [2019-12-18 12:08:25,702 INFO L226 Difference]: Without dead ends: 17503 [2019-12-18 12:08:25,703 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:08:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17503 states. [2019-12-18 12:08:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17503 to 17140. [2019-12-18 12:08:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 12:08:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 53441 transitions. [2019-12-18 12:08:26,380 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 53441 transitions. Word has length 25 [2019-12-18 12:08:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:26,380 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 53441 transitions. [2019-12-18 12:08:26,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:08:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 53441 transitions. [2019-12-18 12:08:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:08:26,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:26,395 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:08:26,395 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:08:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:26,395 INFO L82 PathProgramCache]: Analyzing trace with hash 967503752, now seen corresponding path program 1 times [2019-12-18 12:08:26,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:26,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596523613] [2019-12-18 12:08:26,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:26,442 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:08:26,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596523613] [2019-12-18 12:08:26,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:26,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:26,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853924140] [2019-12-18 12:08:26,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:26,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:26,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:26,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:26,445 INFO L87 Difference]: Start difference. First operand 17140 states and 53441 transitions. Second operand 3 states. [2019-12-18 12:08:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:26,567 INFO L93 Difference]: Finished difference Result 22571 states and 66756 transitions. [2019-12-18 12:08:26,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:26,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 12:08:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:26,609 INFO L225 Difference]: With dead ends: 22571 [2019-12-18 12:08:26,609 INFO L226 Difference]: Without dead ends: 22571 [2019-12-18 12:08:26,610 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:08:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22571 states. [2019-12-18 12:08:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22571 to 17140. [2019-12-18 12:08:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17140 states. [2019-12-18 12:08:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17140 states to 17140 states and 51063 transitions. [2019-12-18 12:08:26,976 INFO L78 Accepts]: Start accepts. Automaton has 17140 states and 51063 transitions. Word has length 27 [2019-12-18 12:08:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:26,976 INFO L462 AbstractCegarLoop]: Abstraction has 17140 states and 51063 transitions. [2019-12-18 12:08:26,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 17140 states and 51063 transitions. [2019-12-18 12:08:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:08:26,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:26,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:26,989 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:08:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:26,989 INFO L82 PathProgramCache]: Analyzing trace with hash 196927527, now seen corresponding path program 1 times [2019-12-18 12:08:26,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:26,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849131229] [2019-12-18 12:08:26,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:27,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849131229] [2019-12-18 12:08:27,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:27,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:27,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187444817] [2019-12-18 12:08:27,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:27,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:27,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:27,050 INFO L87 Difference]: Start difference. First operand 17140 states and 51063 transitions. Second operand 5 states. [2019-12-18 12:08:27,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:27,407 INFO L93 Difference]: Finished difference Result 21146 states and 62188 transitions. [2019-12-18 12:08:27,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:08:27,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:08:27,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:27,440 INFO L225 Difference]: With dead ends: 21146 [2019-12-18 12:08:27,441 INFO L226 Difference]: Without dead ends: 21146 [2019-12-18 12:08:27,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21146 states. [2019-12-18 12:08:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21146 to 19815. [2019-12-18 12:08:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19815 states. [2019-12-18 12:08:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19815 states to 19815 states and 58833 transitions. [2019-12-18 12:08:27,745 INFO L78 Accepts]: Start accepts. Automaton has 19815 states and 58833 transitions. Word has length 27 [2019-12-18 12:08:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:27,745 INFO L462 AbstractCegarLoop]: Abstraction has 19815 states and 58833 transitions. [2019-12-18 12:08:27,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 19815 states and 58833 transitions. [2019-12-18 12:08:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:08:27,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:27,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:27,760 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:08:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1188103809, now seen corresponding path program 1 times [2019-12-18 12:08:27,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:27,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828450873] [2019-12-18 12:08:27,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:27,830 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:08:27,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828450873] [2019-12-18 12:08:27,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:27,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:08:27,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755459072] [2019-12-18 12:08:27,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:27,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:27,832 INFO L87 Difference]: Start difference. First operand 19815 states and 58833 transitions. Second operand 5 states. [2019-12-18 12:08:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:28,169 INFO L93 Difference]: Finished difference Result 23192 states and 68046 transitions. [2019-12-18 12:08:28,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:08:28,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:08:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:28,201 INFO L225 Difference]: With dead ends: 23192 [2019-12-18 12:08:28,202 INFO L226 Difference]: Without dead ends: 23192 [2019-12-18 12:08:28,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23192 states. [2019-12-18 12:08:28,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23192 to 19826. [2019-12-18 12:08:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19826 states. [2019-12-18 12:08:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19826 states to 19826 states and 58720 transitions. [2019-12-18 12:08:28,504 INFO L78 Accepts]: Start accepts. Automaton has 19826 states and 58720 transitions. Word has length 28 [2019-12-18 12:08:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:28,504 INFO L462 AbstractCegarLoop]: Abstraction has 19826 states and 58720 transitions. [2019-12-18 12:08:28,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 19826 states and 58720 transitions. [2019-12-18 12:08:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:08:28,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:28,523 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:08:28,524 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:08:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1042720045, now seen corresponding path program 1 times [2019-12-18 12:08:28,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:28,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849522428] [2019-12-18 12:08:28,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:28,889 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:08:28,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849522428] [2019-12-18 12:08:28,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:28,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:08:28,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208112892] [2019-12-18 12:08:28,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:08:28,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:28,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:08:28,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:08:28,891 INFO L87 Difference]: Start difference. First operand 19826 states and 58720 transitions. Second operand 6 states. [2019-12-18 12:08:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:29,561 INFO L93 Difference]: Finished difference Result 26785 states and 78213 transitions. [2019-12-18 12:08:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:29,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-18 12:08:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:29,597 INFO L225 Difference]: With dead ends: 26785 [2019-12-18 12:08:29,597 INFO L226 Difference]: Without dead ends: 26785 [2019-12-18 12:08:29,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:08:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26785 states. [2019-12-18 12:08:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26785 to 20969. [2019-12-18 12:08:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2019-12-18 12:08:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 62212 transitions. [2019-12-18 12:08:29,927 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 62212 transitions. Word has length 33 [2019-12-18 12:08:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:29,927 INFO L462 AbstractCegarLoop]: Abstraction has 20969 states and 62212 transitions. [2019-12-18 12:08:29,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:08:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 62212 transitions. [2019-12-18 12:08:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:08:29,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:29,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:08:29,948 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:08:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:29,948 INFO L82 PathProgramCache]: Analyzing trace with hash -738339527, now seen corresponding path program 1 times [2019-12-18 12:08:29,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:29,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899506311] [2019-12-18 12:08:29,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:30,032 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:08:30,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899506311] [2019-12-18 12:08:30,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:30,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:08:30,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233402352] [2019-12-18 12:08:30,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:08:30,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:08:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:08:30,034 INFO L87 Difference]: Start difference. First operand 20969 states and 62212 transitions. Second operand 6 states. [2019-12-18 12:08:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:30,712 INFO L93 Difference]: Finished difference Result 25915 states and 75815 transitions. [2019-12-18 12:08:30,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:30,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:08:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:30,762 INFO L225 Difference]: With dead ends: 25915 [2019-12-18 12:08:30,763 INFO L226 Difference]: Without dead ends: 25915 [2019-12-18 12:08:30,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:08:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25915 states. [2019-12-18 12:08:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25915 to 17954. [2019-12-18 12:08:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17954 states. [2019-12-18 12:08:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17954 states to 17954 states and 53419 transitions. [2019-12-18 12:08:31,088 INFO L78 Accepts]: Start accepts. Automaton has 17954 states and 53419 transitions. Word has length 34 [2019-12-18 12:08:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:31,089 INFO L462 AbstractCegarLoop]: Abstraction has 17954 states and 53419 transitions. [2019-12-18 12:08:31,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:08:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 17954 states and 53419 transitions. [2019-12-18 12:08:31,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:08:31,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:31,106 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:08:31,106 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:08:31,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:31,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1814402429, now seen corresponding path program 1 times [2019-12-18 12:08:31,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:31,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889041310] [2019-12-18 12:08:31,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:31,166 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:08:31,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889041310] [2019-12-18 12:08:31,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:31,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:08:31,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974713236] [2019-12-18 12:08:31,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:31,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:31,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:31,168 INFO L87 Difference]: Start difference. First operand 17954 states and 53419 transitions. Second operand 3 states. [2019-12-18 12:08:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:31,235 INFO L93 Difference]: Finished difference Result 17953 states and 53417 transitions. [2019-12-18 12:08:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:31,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:08:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:31,266 INFO L225 Difference]: With dead ends: 17953 [2019-12-18 12:08:31,266 INFO L226 Difference]: Without dead ends: 17953 [2019-12-18 12:08:31,267 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:08:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17953 states. [2019-12-18 12:08:31,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17953 to 17953. [2019-12-18 12:08:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17953 states. [2019-12-18 12:08:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17953 states to 17953 states and 53417 transitions. [2019-12-18 12:08:31,521 INFO L78 Accepts]: Start accepts. Automaton has 17953 states and 53417 transitions. Word has length 39 [2019-12-18 12:08:31,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:31,522 INFO L462 AbstractCegarLoop]: Abstraction has 17953 states and 53417 transitions. [2019-12-18 12:08:31,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17953 states and 53417 transitions. [2019-12-18 12:08:31,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:08:31,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:31,538 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:08:31,538 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:08:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:31,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1557699484, now seen corresponding path program 1 times [2019-12-18 12:08:31,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:31,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178899903] [2019-12-18 12:08:31,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:31,873 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:08:31,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178899903] [2019-12-18 12:08:31,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:31,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:08:31,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711266732] [2019-12-18 12:08:31,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:31,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:31,875 INFO L87 Difference]: Start difference. First operand 17953 states and 53417 transitions. Second operand 5 states. [2019-12-18 12:08:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:31,958 INFO L93 Difference]: Finished difference Result 16745 states and 50707 transitions. [2019-12-18 12:08:31,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:08:31,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:08:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:31,986 INFO L225 Difference]: With dead ends: 16745 [2019-12-18 12:08:31,987 INFO L226 Difference]: Without dead ends: 16745 [2019-12-18 12:08:31,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16745 states. [2019-12-18 12:08:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16745 to 16164. [2019-12-18 12:08:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16164 states. [2019-12-18 12:08:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16164 states to 16164 states and 49138 transitions. [2019-12-18 12:08:32,251 INFO L78 Accepts]: Start accepts. Automaton has 16164 states and 49138 transitions. Word has length 40 [2019-12-18 12:08:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:32,251 INFO L462 AbstractCegarLoop]: Abstraction has 16164 states and 49138 transitions. [2019-12-18 12:08:32,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 16164 states and 49138 transitions. [2019-12-18 12:08:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:08:32,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:32,273 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:08:32,273 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:08:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash -707354115, now seen corresponding path program 1 times [2019-12-18 12:08:32,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:32,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932642671] [2019-12-18 12:08:32,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:32,354 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:08:32,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932642671] [2019-12-18 12:08:32,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:32,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:08:32,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217425311] [2019-12-18 12:08:32,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:32,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:32,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:32,356 INFO L87 Difference]: Start difference. First operand 16164 states and 49138 transitions. Second operand 7 states. [2019-12-18 12:08:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:32,845 INFO L93 Difference]: Finished difference Result 47597 states and 143647 transitions. [2019-12-18 12:08:32,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:32,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:08:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:32,894 INFO L225 Difference]: With dead ends: 47597 [2019-12-18 12:08:32,894 INFO L226 Difference]: Without dead ends: 36910 [2019-12-18 12:08:32,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:08:33,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36910 states. [2019-12-18 12:08:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36910 to 19812. [2019-12-18 12:08:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19812 states. [2019-12-18 12:08:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19812 states to 19812 states and 60413 transitions. [2019-12-18 12:08:33,324 INFO L78 Accepts]: Start accepts. Automaton has 19812 states and 60413 transitions. Word has length 64 [2019-12-18 12:08:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:33,324 INFO L462 AbstractCegarLoop]: Abstraction has 19812 states and 60413 transitions. [2019-12-18 12:08:33,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 19812 states and 60413 transitions. [2019-12-18 12:08:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:08:33,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:33,351 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:08:33,352 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:08:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash -919693373, now seen corresponding path program 2 times [2019-12-18 12:08:33,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:33,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506529358] [2019-12-18 12:08:33,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:33,442 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:08:33,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506529358] [2019-12-18 12:08:33,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:33,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:08:33,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075592881] [2019-12-18 12:08:33,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:33,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:33,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:33,444 INFO L87 Difference]: Start difference. First operand 19812 states and 60413 transitions. Second operand 7 states. [2019-12-18 12:08:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:34,023 INFO L93 Difference]: Finished difference Result 54647 states and 162905 transitions. [2019-12-18 12:08:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:08:34,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:08:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:34,094 INFO L225 Difference]: With dead ends: 54647 [2019-12-18 12:08:34,094 INFO L226 Difference]: Without dead ends: 39740 [2019-12-18 12:08:34,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:08:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39740 states. [2019-12-18 12:08:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39740 to 23243. [2019-12-18 12:08:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23243 states. [2019-12-18 12:08:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23243 states to 23243 states and 70535 transitions. [2019-12-18 12:08:34,912 INFO L78 Accepts]: Start accepts. Automaton has 23243 states and 70535 transitions. Word has length 64 [2019-12-18 12:08:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:34,912 INFO L462 AbstractCegarLoop]: Abstraction has 23243 states and 70535 transitions. [2019-12-18 12:08:34,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 23243 states and 70535 transitions. [2019-12-18 12:08:34,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:08:34,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:34,940 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:08:34,940 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:08:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:34,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1837972597, now seen corresponding path program 3 times [2019-12-18 12:08:34,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:34,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751924526] [2019-12-18 12:08:34,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:35,023 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:08:35,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751924526] [2019-12-18 12:08:35,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:35,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:08:35,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795227303] [2019-12-18 12:08:35,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:35,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:35,025 INFO L87 Difference]: Start difference. First operand 23243 states and 70535 transitions. Second operand 7 states. [2019-12-18 12:08:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:35,657 INFO L93 Difference]: Finished difference Result 45600 states and 136196 transitions. [2019-12-18 12:08:35,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 12:08:35,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:08:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:35,735 INFO L225 Difference]: With dead ends: 45600 [2019-12-18 12:08:35,735 INFO L226 Difference]: Without dead ends: 42889 [2019-12-18 12:08:35,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:08:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42889 states. [2019-12-18 12:08:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42889 to 23339. [2019-12-18 12:08:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23339 states. [2019-12-18 12:08:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23339 states to 23339 states and 70879 transitions. [2019-12-18 12:08:36,263 INFO L78 Accepts]: Start accepts. Automaton has 23339 states and 70879 transitions. Word has length 64 [2019-12-18 12:08:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:36,263 INFO L462 AbstractCegarLoop]: Abstraction has 23339 states and 70879 transitions. [2019-12-18 12:08:36,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23339 states and 70879 transitions. [2019-12-18 12:08:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:08:36,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:36,285 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:08:36,285 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:08:36,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:36,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1711686189, now seen corresponding path program 4 times [2019-12-18 12:08:36,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:36,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225769394] [2019-12-18 12:08:36,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:36,378 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:08:36,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225769394] [2019-12-18 12:08:36,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:36,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:08:36,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219411615] [2019-12-18 12:08:36,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:08:36,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:36,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:08:36,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:08:36,381 INFO L87 Difference]: Start difference. First operand 23339 states and 70879 transitions. Second operand 5 states. [2019-12-18 12:08:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:36,710 INFO L93 Difference]: Finished difference Result 25262 states and 76238 transitions. [2019-12-18 12:08:36,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:08:36,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 12:08:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:36,744 INFO L225 Difference]: With dead ends: 25262 [2019-12-18 12:08:36,745 INFO L226 Difference]: Without dead ends: 25262 [2019-12-18 12:08:36,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:08:36,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25262 states. [2019-12-18 12:08:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25262 to 23767. [2019-12-18 12:08:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23767 states. [2019-12-18 12:08:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23767 states to 23767 states and 72154 transitions. [2019-12-18 12:08:37,087 INFO L78 Accepts]: Start accepts. Automaton has 23767 states and 72154 transitions. Word has length 64 [2019-12-18 12:08:37,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:37,088 INFO L462 AbstractCegarLoop]: Abstraction has 23767 states and 72154 transitions. [2019-12-18 12:08:37,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:08:37,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23767 states and 72154 transitions. [2019-12-18 12:08:37,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:08:37,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:37,111 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:08:37,111 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:08:37,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:37,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1053051045, now seen corresponding path program 5 times [2019-12-18 12:08:37,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:37,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044986680] [2019-12-18 12:08:37,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:37,197 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:08:37,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044986680] [2019-12-18 12:08:37,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:37,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:08:37,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620140583] [2019-12-18 12:08:37,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:08:37,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:37,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:08:37,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:08:37,199 INFO L87 Difference]: Start difference. First operand 23767 states and 72154 transitions. Second operand 7 states. [2019-12-18 12:08:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:38,593 INFO L93 Difference]: Finished difference Result 45527 states and 136651 transitions. [2019-12-18 12:08:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 12:08:38,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:08:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:38,661 INFO L225 Difference]: With dead ends: 45527 [2019-12-18 12:08:38,661 INFO L226 Difference]: Without dead ends: 45359 [2019-12-18 12:08:38,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:08:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45359 states. [2019-12-18 12:08:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45359 to 29967. [2019-12-18 12:08:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29967 states. [2019-12-18 12:08:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29967 states to 29967 states and 89774 transitions. [2019-12-18 12:08:39,229 INFO L78 Accepts]: Start accepts. Automaton has 29967 states and 89774 transitions. Word has length 64 [2019-12-18 12:08:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:39,229 INFO L462 AbstractCegarLoop]: Abstraction has 29967 states and 89774 transitions. [2019-12-18 12:08:39,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:08:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29967 states and 89774 transitions. [2019-12-18 12:08:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:08:39,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:39,271 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:08:39,272 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:08:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -747078789, now seen corresponding path program 6 times [2019-12-18 12:08:39,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:39,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403223023] [2019-12-18 12:08:39,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:39,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403223023] [2019-12-18 12:08:39,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:39,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:39,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141158386] [2019-12-18 12:08:39,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:39,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:39,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:39,366 INFO L87 Difference]: Start difference. First operand 29967 states and 89774 transitions. Second operand 3 states. [2019-12-18 12:08:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:39,490 INFO L93 Difference]: Finished difference Result 29967 states and 89773 transitions. [2019-12-18 12:08:39,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:39,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:08:39,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:39,551 INFO L225 Difference]: With dead ends: 29967 [2019-12-18 12:08:39,551 INFO L226 Difference]: Without dead ends: 29967 [2019-12-18 12:08:39,552 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:08:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29967 states. [2019-12-18 12:08:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29967 to 25556. [2019-12-18 12:08:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25556 states. [2019-12-18 12:08:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25556 states to 25556 states and 77501 transitions. [2019-12-18 12:08:40,026 INFO L78 Accepts]: Start accepts. Automaton has 25556 states and 77501 transitions. Word has length 64 [2019-12-18 12:08:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:40,026 INFO L462 AbstractCegarLoop]: Abstraction has 25556 states and 77501 transitions. [2019-12-18 12:08:40,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 25556 states and 77501 transitions. [2019-12-18 12:08:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:08:40,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:40,053 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:08:40,053 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:08:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1414187811, now seen corresponding path program 1 times [2019-12-18 12:08:40,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:40,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620977104] [2019-12-18 12:08:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:40,125 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:08:40,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620977104] [2019-12-18 12:08:40,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:40,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:08:40,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901285133] [2019-12-18 12:08:40,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:08:40,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:40,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:08:40,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:08:40,130 INFO L87 Difference]: Start difference. First operand 25556 states and 77501 transitions. Second operand 3 states. [2019-12-18 12:08:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:40,215 INFO L93 Difference]: Finished difference Result 19100 states and 57362 transitions. [2019-12-18 12:08:40,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:08:40,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:08:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:40,250 INFO L225 Difference]: With dead ends: 19100 [2019-12-18 12:08:40,250 INFO L226 Difference]: Without dead ends: 19100 [2019-12-18 12:08:40,250 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:08:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19100 states. [2019-12-18 12:08:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19100 to 17794. [2019-12-18 12:08:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17794 states. [2019-12-18 12:08:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17794 states to 17794 states and 53432 transitions. [2019-12-18 12:08:41,255 INFO L78 Accepts]: Start accepts. Automaton has 17794 states and 53432 transitions. Word has length 65 [2019-12-18 12:08:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:41,255 INFO L462 AbstractCegarLoop]: Abstraction has 17794 states and 53432 transitions. [2019-12-18 12:08:41,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:08:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17794 states and 53432 transitions. [2019-12-18 12:08:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:41,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:41,280 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:08:41,280 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:08:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1653836464, now seen corresponding path program 1 times [2019-12-18 12:08:41,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:41,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356551640] [2019-12-18 12:08:41,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:41,519 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:08:41,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356551640] [2019-12-18 12:08:41,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:41,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:08:41,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856372277] [2019-12-18 12:08:41,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:08:41,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:41,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:08:41,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:08:41,523 INFO L87 Difference]: Start difference. First operand 17794 states and 53432 transitions. Second operand 11 states. [2019-12-18 12:08:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:43,208 INFO L93 Difference]: Finished difference Result 26793 states and 80255 transitions. [2019-12-18 12:08:43,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:08:43,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:08:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:43,240 INFO L225 Difference]: With dead ends: 26793 [2019-12-18 12:08:43,241 INFO L226 Difference]: Without dead ends: 21954 [2019-12-18 12:08:43,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:08:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21954 states. [2019-12-18 12:08:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21954 to 18207. [2019-12-18 12:08:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18207 states. [2019-12-18 12:08:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18207 states to 18207 states and 54571 transitions. [2019-12-18 12:08:43,535 INFO L78 Accepts]: Start accepts. Automaton has 18207 states and 54571 transitions. Word has length 66 [2019-12-18 12:08:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:43,535 INFO L462 AbstractCegarLoop]: Abstraction has 18207 states and 54571 transitions. [2019-12-18 12:08:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:08:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18207 states and 54571 transitions. [2019-12-18 12:08:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:43,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:43,554 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:08:43,554 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:08:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1892421244, now seen corresponding path program 2 times [2019-12-18 12:08:43,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:43,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776582159] [2019-12-18 12:08:43,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:08:43,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776582159] [2019-12-18 12:08:43,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:43,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:08:43,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947903205] [2019-12-18 12:08:43,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:08:43,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:08:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:08:43,760 INFO L87 Difference]: Start difference. First operand 18207 states and 54571 transitions. Second operand 12 states. [2019-12-18 12:08:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:45,576 INFO L93 Difference]: Finished difference Result 24205 states and 72194 transitions. [2019-12-18 12:08:45,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 12:08:45,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:08:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:45,606 INFO L225 Difference]: With dead ends: 24205 [2019-12-18 12:08:45,606 INFO L226 Difference]: Without dead ends: 21714 [2019-12-18 12:08:45,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:08:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21714 states. [2019-12-18 12:08:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21714 to 18127. [2019-12-18 12:08:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18127 states. [2019-12-18 12:08:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18127 states to 18127 states and 54331 transitions. [2019-12-18 12:08:45,893 INFO L78 Accepts]: Start accepts. Automaton has 18127 states and 54331 transitions. Word has length 66 [2019-12-18 12:08:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:45,894 INFO L462 AbstractCegarLoop]: Abstraction has 18127 states and 54331 transitions. [2019-12-18 12:08:45,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:08:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18127 states and 54331 transitions. [2019-12-18 12:08:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:45,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:45,912 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:08:45,912 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:08:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash 846611000, now seen corresponding path program 3 times [2019-12-18 12:08:45,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:45,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264188651] [2019-12-18 12:08:45,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:46,394 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:08:46,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264188651] [2019-12-18 12:08:46,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:46,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:08:46,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624351447] [2019-12-18 12:08:46,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:08:46,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:08:46,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:08:46,397 INFO L87 Difference]: Start difference. First operand 18127 states and 54331 transitions. Second operand 9 states. [2019-12-18 12:08:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:48,357 INFO L93 Difference]: Finished difference Result 31723 states and 93457 transitions. [2019-12-18 12:08:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:08:48,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:08:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:48,403 INFO L225 Difference]: With dead ends: 31723 [2019-12-18 12:08:48,403 INFO L226 Difference]: Without dead ends: 31507 [2019-12-18 12:08:48,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:08:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31507 states. [2019-12-18 12:08:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31507 to 21089. [2019-12-18 12:08:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21089 states. [2019-12-18 12:08:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21089 states to 21089 states and 62967 transitions. [2019-12-18 12:08:48,794 INFO L78 Accepts]: Start accepts. Automaton has 21089 states and 62967 transitions. Word has length 66 [2019-12-18 12:08:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:48,795 INFO L462 AbstractCegarLoop]: Abstraction has 21089 states and 62967 transitions. [2019-12-18 12:08:48,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:08:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 21089 states and 62967 transitions. [2019-12-18 12:08:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:48,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:48,817 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:08:48,817 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:08:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1362505834, now seen corresponding path program 4 times [2019-12-18 12:08:48,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:48,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361328206] [2019-12-18 12:08:48,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:48,988 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:08:48,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361328206] [2019-12-18 12:08:48,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:48,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:08:48,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48363589] [2019-12-18 12:08:48,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:08:48,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:08:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:08:48,991 INFO L87 Difference]: Start difference. First operand 21089 states and 62967 transitions. Second operand 10 states. [2019-12-18 12:08:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:50,235 INFO L93 Difference]: Finished difference Result 32972 states and 97287 transitions. [2019-12-18 12:08:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:08:50,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:08:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:50,273 INFO L225 Difference]: With dead ends: 32972 [2019-12-18 12:08:50,273 INFO L226 Difference]: Without dead ends: 27570 [2019-12-18 12:08:50,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 12:08:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27570 states. [2019-12-18 12:08:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27570 to 21670. [2019-12-18 12:08:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21670 states. [2019-12-18 12:08:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21670 states to 21670 states and 64322 transitions. [2019-12-18 12:08:50,613 INFO L78 Accepts]: Start accepts. Automaton has 21670 states and 64322 transitions. Word has length 66 [2019-12-18 12:08:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:50,613 INFO L462 AbstractCegarLoop]: Abstraction has 21670 states and 64322 transitions. [2019-12-18 12:08:50,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:08:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21670 states and 64322 transitions. [2019-12-18 12:08:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:50,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:50,633 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:08:50,633 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:08:50,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash 40066062, now seen corresponding path program 5 times [2019-12-18 12:08:50,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:50,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604157106] [2019-12-18 12:08:50,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:50,835 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:08:50,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604157106] [2019-12-18 12:08:50,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:50,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:08:50,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127776624] [2019-12-18 12:08:50,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:08:50,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:50,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:08:50,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:08:50,836 INFO L87 Difference]: Start difference. First operand 21670 states and 64322 transitions. Second operand 11 states. [2019-12-18 12:08:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:52,533 INFO L93 Difference]: Finished difference Result 31616 states and 93060 transitions. [2019-12-18 12:08:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:08:52,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:08:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:52,573 INFO L225 Difference]: With dead ends: 31616 [2019-12-18 12:08:52,574 INFO L226 Difference]: Without dead ends: 27257 [2019-12-18 12:08:52,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:08:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27257 states. [2019-12-18 12:08:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27257 to 21220. [2019-12-18 12:08:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-18 12:08:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 63019 transitions. [2019-12-18 12:08:52,915 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 63019 transitions. Word has length 66 [2019-12-18 12:08:52,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:52,915 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 63019 transitions. [2019-12-18 12:08:52,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:08:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 63019 transitions. [2019-12-18 12:08:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:52,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:52,936 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:08:52,936 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:08:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash 132262848, now seen corresponding path program 6 times [2019-12-18 12:08:52,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:52,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322723090] [2019-12-18 12:08:52,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:53,146 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:08:53,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322723090] [2019-12-18 12:08:53,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:53,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:08:53,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12209930] [2019-12-18 12:08:53,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 12:08:53,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 12:08:53,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:08:53,148 INFO L87 Difference]: Start difference. First operand 21220 states and 63019 transitions. Second operand 13 states. [2019-12-18 12:08:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:55,196 INFO L93 Difference]: Finished difference Result 31094 states and 91922 transitions. [2019-12-18 12:08:55,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:08:55,197 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 12:08:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:55,236 INFO L225 Difference]: With dead ends: 31094 [2019-12-18 12:08:55,236 INFO L226 Difference]: Without dead ends: 27143 [2019-12-18 12:08:55,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:08:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27143 states. [2019-12-18 12:08:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27143 to 21562. [2019-12-18 12:08:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21562 states. [2019-12-18 12:08:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21562 states to 21562 states and 63857 transitions. [2019-12-18 12:08:55,587 INFO L78 Accepts]: Start accepts. Automaton has 21562 states and 63857 transitions. Word has length 66 [2019-12-18 12:08:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:55,587 INFO L462 AbstractCegarLoop]: Abstraction has 21562 states and 63857 transitions. [2019-12-18 12:08:55,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 12:08:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21562 states and 63857 transitions. [2019-12-18 12:08:55,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:55,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:55,611 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:08:55,611 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:08:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:55,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1172813812, now seen corresponding path program 7 times [2019-12-18 12:08:55,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:55,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383038721] [2019-12-18 12:08:55,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:55,797 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:08:55,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383038721] [2019-12-18 12:08:55,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:55,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:08:55,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127847867] [2019-12-18 12:08:55,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:08:55,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:55,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:08:55,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:08:55,799 INFO L87 Difference]: Start difference. First operand 21562 states and 63857 transitions. Second operand 12 states. [2019-12-18 12:08:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:57,517 INFO L93 Difference]: Finished difference Result 48755 states and 144539 transitions. [2019-12-18 12:08:57,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 12:08:57,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:08:57,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:57,576 INFO L225 Difference]: With dead ends: 48755 [2019-12-18 12:08:57,576 INFO L226 Difference]: Without dead ends: 46200 [2019-12-18 12:08:57,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 12:08:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46200 states. [2019-12-18 12:08:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46200 to 25000. [2019-12-18 12:08:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25000 states. [2019-12-18 12:08:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25000 states to 25000 states and 73595 transitions. [2019-12-18 12:08:58,091 INFO L78 Accepts]: Start accepts. Automaton has 25000 states and 73595 transitions. Word has length 66 [2019-12-18 12:08:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:08:58,091 INFO L462 AbstractCegarLoop]: Abstraction has 25000 states and 73595 transitions. [2019-12-18 12:08:58,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:08:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 25000 states and 73595 transitions. [2019-12-18 12:08:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:08:58,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:08:58,116 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:08:58,117 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:08:58,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:08:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1318207092, now seen corresponding path program 8 times [2019-12-18 12:08:58,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:08:58,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432594399] [2019-12-18 12:08:58,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:08:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:08:58,288 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:08:58,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432594399] [2019-12-18 12:08:58,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:08:58,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:08:58,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816855867] [2019-12-18 12:08:58,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:08:58,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:08:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:08:58,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:08:58,290 INFO L87 Difference]: Start difference. First operand 25000 states and 73595 transitions. Second operand 12 states. [2019-12-18 12:08:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:08:59,599 INFO L93 Difference]: Finished difference Result 46816 states and 137385 transitions. [2019-12-18 12:08:59,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:08:59,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 12:08:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:08:59,651 INFO L225 Difference]: With dead ends: 46816 [2019-12-18 12:08:59,651 INFO L226 Difference]: Without dead ends: 38274 [2019-12-18 12:08:59,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=634, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:08:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38274 states. [2019-12-18 12:09:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38274 to 19880. [2019-12-18 12:09:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19880 states. [2019-12-18 12:09:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19880 states to 19880 states and 59019 transitions. [2019-12-18 12:09:00,060 INFO L78 Accepts]: Start accepts. Automaton has 19880 states and 59019 transitions. Word has length 66 [2019-12-18 12:09:00,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:00,060 INFO L462 AbstractCegarLoop]: Abstraction has 19880 states and 59019 transitions. [2019-12-18 12:09:00,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:09:00,060 INFO L276 IsEmpty]: Start isEmpty. Operand 19880 states and 59019 transitions. [2019-12-18 12:09:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:00,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:00,079 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:09:00,079 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:09:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1994986876, now seen corresponding path program 9 times [2019-12-18 12:09:00,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:00,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096969637] [2019-12-18 12:09:00,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:00,218 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:09:00,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096969637] [2019-12-18 12:09:00,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:00,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:00,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452620380] [2019-12-18 12:09:00,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:09:00,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:00,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:09:00,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:09:00,220 INFO L87 Difference]: Start difference. First operand 19880 states and 59019 transitions. Second operand 9 states. [2019-12-18 12:09:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:02,778 INFO L93 Difference]: Finished difference Result 35383 states and 102963 transitions. [2019-12-18 12:09:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:09:02,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:09:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:02,823 INFO L225 Difference]: With dead ends: 35383 [2019-12-18 12:09:02,824 INFO L226 Difference]: Without dead ends: 34999 [2019-12-18 12:09:02,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:09:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34999 states. [2019-12-18 12:09:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34999 to 21405. [2019-12-18 12:09:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21405 states. [2019-12-18 12:09:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21405 states to 21405 states and 63758 transitions. [2019-12-18 12:09:03,220 INFO L78 Accepts]: Start accepts. Automaton has 21405 states and 63758 transitions. Word has length 66 [2019-12-18 12:09:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:03,220 INFO L462 AbstractCegarLoop]: Abstraction has 21405 states and 63758 transitions. [2019-12-18 12:09:03,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:09:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 21405 states and 63758 transitions. [2019-12-18 12:09:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:03,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:03,244 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:09:03,244 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:09:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -30250858, now seen corresponding path program 10 times [2019-12-18 12:09:03,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:03,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861854530] [2019-12-18 12:09:03,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:03,411 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:09:03,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861854530] [2019-12-18 12:09:03,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:03,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:09:03,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255702547] [2019-12-18 12:09:03,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:09:03,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:09:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:09:03,413 INFO L87 Difference]: Start difference. First operand 21405 states and 63758 transitions. Second operand 10 states. [2019-12-18 12:09:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:05,961 INFO L93 Difference]: Finished difference Result 39544 states and 115561 transitions. [2019-12-18 12:09:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:09:05,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 12:09:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:06,015 INFO L225 Difference]: With dead ends: 39544 [2019-12-18 12:09:06,015 INFO L226 Difference]: Without dead ends: 39348 [2019-12-18 12:09:06,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:09:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39348 states. [2019-12-18 12:09:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39348 to 24231. [2019-12-18 12:09:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24231 states. [2019-12-18 12:09:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24231 states to 24231 states and 71846 transitions. [2019-12-18 12:09:06,497 INFO L78 Accepts]: Start accepts. Automaton has 24231 states and 71846 transitions. Word has length 66 [2019-12-18 12:09:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:06,497 INFO L462 AbstractCegarLoop]: Abstraction has 24231 states and 71846 transitions. [2019-12-18 12:09:06,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:09:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 24231 states and 71846 transitions. [2019-12-18 12:09:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:09:06,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:06,525 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:09:06,525 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:06,525 INFO L82 PathProgramCache]: Analyzing trace with hash -222742524, now seen corresponding path program 11 times [2019-12-18 12:09:06,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:06,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858100389] [2019-12-18 12:09:06,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:06,605 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:09:06,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858100389] [2019-12-18 12:09:06,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:06,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:09:06,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761534309] [2019-12-18 12:09:06,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:09:06,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:06,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:09:06,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:09:06,607 INFO L87 Difference]: Start difference. First operand 24231 states and 71846 transitions. Second operand 4 states. [2019-12-18 12:09:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:06,770 INFO L93 Difference]: Finished difference Result 27801 states and 82784 transitions. [2019-12-18 12:09:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:09:06,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 12:09:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:06,807 INFO L225 Difference]: With dead ends: 27801 [2019-12-18 12:09:06,807 INFO L226 Difference]: Without dead ends: 27801 [2019-12-18 12:09:06,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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:09:06,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27801 states. [2019-12-18 12:09:07,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27801 to 21227. [2019-12-18 12:09:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21227 states. [2019-12-18 12:09:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21227 states to 21227 states and 63769 transitions. [2019-12-18 12:09:07,530 INFO L78 Accepts]: Start accepts. Automaton has 21227 states and 63769 transitions. Word has length 66 [2019-12-18 12:09:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:07,530 INFO L462 AbstractCegarLoop]: Abstraction has 21227 states and 63769 transitions. [2019-12-18 12:09:07,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:09:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 21227 states and 63769 transitions. [2019-12-18 12:09:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:07,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:07,551 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:09:07,551 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:07,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1758425944, now seen corresponding path program 1 times [2019-12-18 12:09:07,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:07,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910022023] [2019-12-18 12:09:07,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:07,679 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:09:07,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910022023] [2019-12-18 12:09:07,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:07,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:07,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715050211] [2019-12-18 12:09:07,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:09:07,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:07,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:09:07,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:09:07,681 INFO L87 Difference]: Start difference. First operand 21227 states and 63769 transitions. Second operand 9 states. [2019-12-18 12:09:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:09,997 INFO L93 Difference]: Finished difference Result 33338 states and 98105 transitions. [2019-12-18 12:09:09,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:09:09,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 12:09:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:10,044 INFO L225 Difference]: With dead ends: 33338 [2019-12-18 12:09:10,044 INFO L226 Difference]: Without dead ends: 33338 [2019-12-18 12:09:10,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:09:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33338 states. [2019-12-18 12:09:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33338 to 22374. [2019-12-18 12:09:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22374 states. [2019-12-18 12:09:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22374 states to 22374 states and 67020 transitions. [2019-12-18 12:09:10,447 INFO L78 Accepts]: Start accepts. Automaton has 22374 states and 67020 transitions. Word has length 67 [2019-12-18 12:09:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:10,447 INFO L462 AbstractCegarLoop]: Abstraction has 22374 states and 67020 transitions. [2019-12-18 12:09:10,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:09:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 22374 states and 67020 transitions. [2019-12-18 12:09:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:10,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:10,469 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:09:10,469 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:10,469 INFO L82 PathProgramCache]: Analyzing trace with hash -917850962, now seen corresponding path program 1 times [2019-12-18 12:09:10,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:10,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068952431] [2019-12-18 12:09:10,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:10,613 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:09:10,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068952431] [2019-12-18 12:09:10,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:10,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:09:10,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262196179] [2019-12-18 12:09:10,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:09:10,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:10,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:09:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:09:10,616 INFO L87 Difference]: Start difference. First operand 22374 states and 67020 transitions. Second operand 11 states. [2019-12-18 12:09:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:11,779 INFO L93 Difference]: Finished difference Result 29218 states and 86326 transitions. [2019-12-18 12:09:11,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:09:11,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 12:09:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:11,819 INFO L225 Difference]: With dead ends: 29218 [2019-12-18 12:09:11,819 INFO L226 Difference]: Without dead ends: 26687 [2019-12-18 12:09:11,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:09:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26687 states. [2019-12-18 12:09:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26687 to 22358. [2019-12-18 12:09:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22358 states. [2019-12-18 12:09:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22358 states to 22358 states and 66964 transitions. [2019-12-18 12:09:12,182 INFO L78 Accepts]: Start accepts. Automaton has 22358 states and 66964 transitions. Word has length 67 [2019-12-18 12:09:12,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:12,182 INFO L462 AbstractCegarLoop]: Abstraction has 22358 states and 66964 transitions. [2019-12-18 12:09:12,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:09:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand 22358 states and 66964 transitions. [2019-12-18 12:09:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:12,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:12,204 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:09:12,204 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash 226014226, now seen corresponding path program 2 times [2019-12-18 12:09:12,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:12,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049893086] [2019-12-18 12:09:12,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:12,617 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:09:12,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049893086] [2019-12-18 12:09:12,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:12,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:09:12,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019077877] [2019-12-18 12:09:12,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:09:12,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:09:12,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:09:12,619 INFO L87 Difference]: Start difference. First operand 22358 states and 66964 transitions. Second operand 15 states. [2019-12-18 12:09:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:15,426 INFO L93 Difference]: Finished difference Result 31704 states and 93243 transitions. [2019-12-18 12:09:15,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 12:09:15,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 12:09:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:15,465 INFO L225 Difference]: With dead ends: 31704 [2019-12-18 12:09:15,465 INFO L226 Difference]: Without dead ends: 29581 [2019-12-18 12:09:15,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 12:09:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29581 states. [2019-12-18 12:09:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29581 to 22518. [2019-12-18 12:09:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22518 states. [2019-12-18 12:09:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22518 states to 22518 states and 67372 transitions. [2019-12-18 12:09:15,832 INFO L78 Accepts]: Start accepts. Automaton has 22518 states and 67372 transitions. Word has length 67 [2019-12-18 12:09:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:15,832 INFO L462 AbstractCegarLoop]: Abstraction has 22518 states and 67372 transitions. [2019-12-18 12:09:15,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:09:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22518 states and 67372 transitions. [2019-12-18 12:09:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:15,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:15,854 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:09:15,855 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:15,855 INFO L82 PathProgramCache]: Analyzing trace with hash -222673432, now seen corresponding path program 3 times [2019-12-18 12:09:15,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:15,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489000800] [2019-12-18 12:09:15,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:16,221 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:09:16,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489000800] [2019-12-18 12:09:16,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:16,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:09:16,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452827988] [2019-12-18 12:09:16,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:09:16,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:16,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:09:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:09:16,223 INFO L87 Difference]: Start difference. First operand 22518 states and 67372 transitions. Second operand 15 states. [2019-12-18 12:09:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:19,021 INFO L93 Difference]: Finished difference Result 30704 states and 90329 transitions. [2019-12-18 12:09:19,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 12:09:19,021 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 12:09:19,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:19,062 INFO L225 Difference]: With dead ends: 30704 [2019-12-18 12:09:19,062 INFO L226 Difference]: Without dead ends: 29093 [2019-12-18 12:09:19,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:09:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29093 states. [2019-12-18 12:09:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29093 to 22218. [2019-12-18 12:09:19,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22218 states. [2019-12-18 12:09:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 66608 transitions. [2019-12-18 12:09:19,441 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 66608 transitions. Word has length 67 [2019-12-18 12:09:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:19,441 INFO L462 AbstractCegarLoop]: Abstraction has 22218 states and 66608 transitions. [2019-12-18 12:09:19,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:09:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 66608 transitions. [2019-12-18 12:09:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:19,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:19,469 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:09:19,469 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 63997864, now seen corresponding path program 2 times [2019-12-18 12:09:19,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:19,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589036417] [2019-12-18 12:09:19,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:09:19,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589036417] [2019-12-18 12:09:19,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:19,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:09:19,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004158826] [2019-12-18 12:09:19,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:09:19,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:19,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:09:19,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:09:19,621 INFO L87 Difference]: Start difference. First operand 22218 states and 66608 transitions. Second operand 10 states. [2019-12-18 12:09:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:22,224 INFO L93 Difference]: Finished difference Result 36977 states and 108578 transitions. [2019-12-18 12:09:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 12:09:22,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 12:09:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:22,273 INFO L225 Difference]: With dead ends: 36977 [2019-12-18 12:09:22,273 INFO L226 Difference]: Without dead ends: 36977 [2019-12-18 12:09:22,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:09:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36977 states. [2019-12-18 12:09:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36977 to 22220. [2019-12-18 12:09:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22220 states. [2019-12-18 12:09:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22220 states to 22220 states and 66501 transitions. [2019-12-18 12:09:22,707 INFO L78 Accepts]: Start accepts. Automaton has 22220 states and 66501 transitions. Word has length 67 [2019-12-18 12:09:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:22,707 INFO L462 AbstractCegarLoop]: Abstraction has 22220 states and 66501 transitions. [2019-12-18 12:09:22,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:09:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 22220 states and 66501 transitions. [2019-12-18 12:09:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:22,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:22,732 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:09:22,732 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:22,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1827328022, now seen corresponding path program 3 times [2019-12-18 12:09:22,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:22,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940959170] [2019-12-18 12:09:22,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:09:22,810 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:09:22,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940959170] [2019-12-18 12:09:22,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:09:22,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:09:22,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396388535] [2019-12-18 12:09:22,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:09:22,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:09:22,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:09:22,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:09:22,812 INFO L87 Difference]: Start difference. First operand 22220 states and 66501 transitions. Second operand 5 states. [2019-12-18 12:09:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:09:22,954 INFO L93 Difference]: Finished difference Result 21822 states and 64982 transitions. [2019-12-18 12:09:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:09:22,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 12:09:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:09:22,982 INFO L225 Difference]: With dead ends: 21822 [2019-12-18 12:09:22,982 INFO L226 Difference]: Without dead ends: 21822 [2019-12-18 12:09:22,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:09:23,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21822 states. [2019-12-18 12:09:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21822 to 19176. [2019-12-18 12:09:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2019-12-18 12:09:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 57195 transitions. [2019-12-18 12:09:23,284 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 57195 transitions. Word has length 67 [2019-12-18 12:09:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:09:23,284 INFO L462 AbstractCegarLoop]: Abstraction has 19176 states and 57195 transitions. [2019-12-18 12:09:23,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:09:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 57195 transitions. [2019-12-18 12:09:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:09:23,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:09:23,304 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:09:23,304 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:09:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:09:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1210625396, now seen corresponding path program 4 times [2019-12-18 12:09:23,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:09:23,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946895877] [2019-12-18 12:09:23,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:09:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:09:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:09:23,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:09:23,413 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:09:23,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$r_buff0_thd2~0_185 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t68~0.base_32|) (= 0 v_~x~0_134) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t68~0.base_32| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t68~0.base_32|) |v_ULTIMATE.start_main_~#t68~0.offset_23| 0)) |v_#memory_int_21|) (= v_~z$w_buff0_used~0_784 0) (= v_~__unbuffered_p1_EBX~0_36 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1_used~0_442 0) (= |v_#NULL.offset_7| 0) (= v_~z~0_178 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t68~0.base_32|)) (= v_~z$r_buff1_thd0~0_195 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= v_~z$read_delayed~0_6 0) (= v_~y~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t68~0.base_32| 1)) (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 0 v_~__unbuffered_cnt~0_87) (= v_~weak$$choice2~0_133 0) (= v_~z$r_buff0_thd1~0_306 0) (= 0 v_~z$flush_delayed~0_26) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff0_thd3~0_400) (= v_~z$w_buff1~0_222 0) (= 0 v_~__unbuffered_p0_EAX~0_142) (= |v_ULTIMATE.start_main_~#t68~0.offset_23| 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~z$r_buff1_thd3~0_306) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t68~0.base_32| 4)) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff1_thd1~0_175 0) (= v_~z$r_buff1_thd2~0_185 0) (= v_~z$w_buff0~0_312 0) (= v_~z$r_buff0_thd0~0_204 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_42|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_54|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_34|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_204, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_142, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_~#t68~0.offset=|v_ULTIMATE.start_main_~#t68~0.offset_23|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_~#t70~0.offset=|v_ULTIMATE.start_main_~#t70~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_~#t70~0.base=|v_ULTIMATE.start_main_~#t70~0.base_16|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_442, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_175, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_400, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~x~0=v_~x~0_134, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_222, ULTIMATE.start_main_~#t69~0.offset=|v_ULTIMATE.start_main_~#t69~0.offset_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_62|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_195, ~y~0=v_~y~0_24, ULTIMATE.start_main_~#t69~0.base=|v_ULTIMATE.start_main_~#t69~0.base_29|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_36, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_312, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t68~0.base=|v_ULTIMATE.start_main_~#t68~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_133, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_306} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t68~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t70~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t70~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t69~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t69~0.base, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t68~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:23,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L750: Formula: (and (= ~z$r_buff1_thd2~0_Out43321826 ~z$r_buff0_thd2~0_In43321826) (= ~x~0_In43321826 ~__unbuffered_p0_EAX~0_Out43321826) (= ~z$r_buff0_thd1~0_In43321826 ~z$r_buff1_thd1~0_Out43321826) (= ~z$r_buff0_thd3~0_In43321826 ~z$r_buff1_thd3~0_Out43321826) (= ~z$r_buff1_thd0~0_Out43321826 ~z$r_buff0_thd0~0_In43321826) (= 1 ~z$r_buff0_thd1~0_Out43321826) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In43321826 0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In43321826, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In43321826, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In43321826, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In43321826, ~x~0=~x~0_In43321826, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In43321826} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out43321826, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In43321826, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out43321826, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out43321826, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out43321826, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out43321826, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In43321826, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In43321826, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out43321826, ~x~0=~x~0_In43321826, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In43321826} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:23,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t69~0.offset_10| 0) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t69~0.base_11|) 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t69~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t69~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t69~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t69~0.base_11|) |v_ULTIMATE.start_main_~#t69~0.offset_10| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t69~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t69~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t69~0.offset=|v_ULTIMATE.start_main_~#t69~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t69~0.base=|v_ULTIMATE.start_main_~#t69~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t69~0.offset, #length, ULTIMATE.start_main_~#t69~0.base] because there is no mapped edge [2019-12-18 12:09:23,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1201084114| |P1Thread1of1ForFork2_#t~ite10_Out1201084114|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1201084114 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In1201084114 256) 0))) (or (and (not .cse0) .cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1201084114| ~z$w_buff1~0_In1201084114) (not .cse2)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1201084114| ~z~0_In1201084114) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1201084114, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1201084114, ~z$w_buff1~0=~z$w_buff1~0_In1201084114, ~z~0=~z~0_In1201084114} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1201084114|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1201084114, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1201084114|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1201084114, ~z$w_buff1~0=~z$w_buff1~0_In1201084114, ~z~0=~z~0_In1201084114} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:09:23,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2142273787 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2142273787 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-2142273787|)) (and (= ~z$w_buff0_used~0_In-2142273787 |P1Thread1of1ForFork2_#t~ite11_Out-2142273787|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142273787, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2142273787} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2142273787, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-2142273787|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2142273787} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:09:23,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L834-1-->L836: Formula: (and (not (= |v_ULTIMATE.start_main_~#t70~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t70~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t70~0.base_11|) |v_ULTIMATE.start_main_~#t70~0.offset_10| 2)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t70~0.base_11| 1) |v_#valid_31|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t70~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t70~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t70~0.base_11|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t70~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t70~0.offset=|v_ULTIMATE.start_main_~#t70~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t70~0.base=|v_ULTIMATE.start_main_~#t70~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t70~0.offset, ULTIMATE.start_main_~#t70~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-18 12:09:23,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-50820456 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-50820456 256)))) (or (and (= ~z$w_buff0_used~0_In-50820456 |P0Thread1of1ForFork1_#t~ite5_Out-50820456|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-50820456|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-50820456, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-50820456} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-50820456|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-50820456, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-50820456} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:09:23,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1829480438 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1829480438 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-1829480438 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1829480438 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1829480438| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1829480438| ~z$w_buff1_used~0_In-1829480438) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829480438, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1829480438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829480438, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1829480438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1829480438, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1829480438|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1829480438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1829480438, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1829480438} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:09:23,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1951795642 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1951795642 256)))) (or (and (= ~z$r_buff0_thd1~0_In-1951795642 ~z$r_buff0_thd1~0_Out-1951795642) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out-1951795642 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1951795642, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1951795642} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1951795642, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1951795642|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1951795642} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:09:23,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-297673799 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-297673799 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-297673799 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-297673799 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-297673799| ~z$r_buff1_thd1~0_In-297673799) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-297673799| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-297673799, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-297673799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-297673799, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-297673799} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-297673799|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-297673799, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-297673799, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-297673799, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-297673799} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:09:23,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L754-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_78 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_78, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:09:23,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1125942837 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1125942837 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1125942837 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1125942837 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out1125942837| 0)) (and (= ~z$w_buff1_used~0_In1125942837 |P1Thread1of1ForFork2_#t~ite12_Out1125942837|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1125942837, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1125942837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1125942837, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1125942837} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1125942837, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1125942837, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1125942837, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1125942837|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1125942837} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:09:23,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1305353829 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1305353829 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1305353829| ~z$r_buff0_thd2~0_In1305353829)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out1305353829| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1305353829, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1305353829} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1305353829, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1305353829|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1305353829} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:09:23,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-246369380 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-246369380 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-246369380 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-246369380 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-246369380|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-246369380 |P1Thread1of1ForFork2_#t~ite14_Out-246369380|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-246369380, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-246369380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-246369380, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-246369380} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-246369380, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-246369380, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-246369380, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-246369380|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-246369380} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:09:23,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L777-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~z$r_buff1_thd2~0_132 |v_P1Thread1of1ForFork2_#t~ite14_36|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_132, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:09:23,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1129060960 256)))) (or (and .cse0 (= ~z$w_buff1_used~0_In-1129060960 |P2Thread1of1ForFork0_#t~ite29_Out-1129060960|) (= |P2Thread1of1ForFork0_#t~ite30_Out-1129060960| |P2Thread1of1ForFork0_#t~ite29_Out-1129060960|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1129060960 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-1129060960 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1129060960 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1129060960 256) 0))))) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out-1129060960| ~z$w_buff1_used~0_In-1129060960) (= |P2Thread1of1ForFork0_#t~ite29_In-1129060960| |P2Thread1of1ForFork0_#t~ite29_Out-1129060960|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1129060960, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1129060960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1129060960, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1129060960, ~weak$$choice2~0=~weak$$choice2~0_In-1129060960, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1129060960|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1129060960, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1129060960, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1129060960, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1129060960, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1129060960|, ~weak$$choice2~0=~weak$$choice2~0_In-1129060960, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1129060960|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:09:23,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~z$r_buff0_thd3~0_58 v_~z$r_buff0_thd3~0_59)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_58, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:09:23,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_56 v_~z$mem_tmp~0_5) (= 0 v_~z$flush_delayed~0_11) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:09:23,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-257277353 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-257277353 256) 0))) (or (and (= ~z~0_In-257277353 |P2Thread1of1ForFork0_#t~ite38_Out-257277353|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-257277353| ~z$w_buff1~0_In-257277353) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-257277353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-257277353, ~z$w_buff1~0=~z$w_buff1~0_In-257277353, ~z~0=~z~0_In-257277353} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-257277353|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-257277353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-257277353, ~z$w_buff1~0=~z$w_buff1~0_In-257277353, ~z~0=~z~0_In-257277353} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:09:23,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_38 |v_P2Thread1of1ForFork0_#t~ite38_14|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_14|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:09:23,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1303185232 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1303185232 256)))) (or (and (= ~z$w_buff0_used~0_In-1303185232 |P2Thread1of1ForFork0_#t~ite40_Out-1303185232|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1303185232|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1303185232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1303185232} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1303185232, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1303185232|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1303185232} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:09:23,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1668720496 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1668720496 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In1668720496 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1668720496 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1668720496|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1668720496 |P2Thread1of1ForFork0_#t~ite41_Out1668720496|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1668720496, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1668720496, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1668720496, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1668720496} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1668720496, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1668720496, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1668720496, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1668720496, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1668720496|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:09:23,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In248195194 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In248195194 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out248195194| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out248195194| ~z$r_buff0_thd3~0_In248195194) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In248195194, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In248195194} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In248195194, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In248195194, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out248195194|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:09:23,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-177214926 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-177214926 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-177214926 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-177214926 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-177214926 |P2Thread1of1ForFork0_#t~ite43_Out-177214926|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-177214926| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-177214926, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-177214926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-177214926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-177214926} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-177214926|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-177214926, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-177214926, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-177214926, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-177214926} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:09:23,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~z$r_buff1_thd3~0_188 |v_P2Thread1of1ForFork0_#t~ite43_34|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_188, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:09:23,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 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_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:09:23,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-614742461| |ULTIMATE.start_main_#t~ite48_Out-614742461|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-614742461 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-614742461 256) 0))) (or (and (= ~z$w_buff1~0_In-614742461 |ULTIMATE.start_main_#t~ite47_Out-614742461|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In-614742461 |ULTIMATE.start_main_#t~ite47_Out-614742461|) .cse2 (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-614742461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-614742461, ~z$w_buff1~0=~z$w_buff1~0_In-614742461, ~z~0=~z~0_In-614742461} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-614742461, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-614742461|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-614742461, ~z$w_buff1~0=~z$w_buff1~0_In-614742461, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-614742461|, ~z~0=~z~0_In-614742461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:09:23,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-701931514 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-701931514 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-701931514|)) (and (= ~z$w_buff0_used~0_In-701931514 |ULTIMATE.start_main_#t~ite49_Out-701931514|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-701931514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-701931514} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-701931514, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-701931514, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-701931514|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:09:23,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In-1633991479 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1633991479 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1633991479 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1633991479 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1633991479| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-1633991479| ~z$w_buff1_used~0_In-1633991479) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1633991479, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1633991479, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1633991479, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1633991479} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1633991479|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1633991479, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1633991479, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1633991479, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1633991479} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:09:23,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In30747685 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In30747685 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out30747685| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out30747685| ~z$r_buff0_thd0~0_In30747685) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In30747685, ~z$w_buff0_used~0=~z$w_buff0_used~0_In30747685} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In30747685, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out30747685|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In30747685} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:09:23,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1632669678 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1632669678 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1632669678 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1632669678 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1632669678|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1632669678 |ULTIMATE.start_main_#t~ite52_Out1632669678|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1632669678, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1632669678, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1632669678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1632669678} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1632669678|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1632669678, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1632669678, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1632669678, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1632669678} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:09:23,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~z$r_buff1_thd0~0_155 |v_ULTIMATE.start_main_#t~ite52_46|) (= 0 v_~__unbuffered_p0_EAX~0_114) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_46|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_114, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_45|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_155, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:09:23,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:09:23 BasicIcfg [2019-12-18 12:09:23,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:09:23,577 INFO L168 Benchmark]: Toolchain (without parser) took 132638.19 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 12:09:23,578 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 12:09:23,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 919.12 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.5 MB in the beginning and 158.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:23,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.12 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:09:23,579 INFO L168 Benchmark]: Boogie Preprocessor took 41.78 ms. Allocated memory is still 205.0 MB. Free memory was 155.3 MB in the beginning and 153.3 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:09:23,579 INFO L168 Benchmark]: RCFGBuilder took 859.31 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 102.6 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:09:23,579 INFO L168 Benchmark]: TraceAbstraction took 130746.07 ms. Allocated memory was 205.0 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:09:23,581 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.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 919.12 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.5 MB in the beginning and 158.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.12 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.78 ms. Allocated memory is still 205.0 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 859.31 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 102.6 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130746.07 ms. Allocated memory was 205.0 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 29 ChoiceCompositions, 7593 VarBasedMoverChecksPositive, 373 VarBasedMoverChecksNegative, 200 SemBasedMoverChecksPositive, 268 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 132619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t68, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t69, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t70, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 130.3s, OverallIterations: 41, TraceHistogramMax: 1, AutomataDifference: 52.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10995 SDtfs, 12438 SDslu, 41235 SDs, 0 SdLazy, 30208 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 606 GetRequests, 72 SyntacticMatches, 30 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153153occurred 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: 43.9s AutomataMinimizationTime, 40 MinimizatonAttempts, 331462 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2016 NumberOfCodeBlocks, 2016 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1909 ConstructedInterpolants, 0 QuantifiedInterpolants, 523078 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...