/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/mix049_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:49:10,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:49:10,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:49:10,620 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:49:10,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:49:10,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:49:10,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:49:10,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:49:10,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:49:10,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:49:10,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:49:10,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:49:10,644 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:49:10,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:49:10,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:49:10,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:49:10,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:49:10,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:49:10,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:49:10,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:49:10,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:49:10,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:49:10,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:49:10,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:49:10,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:49:10,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:49:10,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:49:10,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:49:10,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:49:10,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:49:10,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:49:10,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:49:10,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:49:10,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:49:10,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:49:10,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:49:10,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:49:10,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:49:10,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:49:10,669 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:49:10,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:49:10,671 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-26 22:49:10,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:49:10,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:49:10,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:49:10,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:49:10,690 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:49:10,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:49:10,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:49:10,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:49:10,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:49:10,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:49:10,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:49:10,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:49:10,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:49:10,692 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:49:10,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:49:10,692 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:49:10,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:49:10,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:49:10,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:49:10,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:49:10,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:49:10,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:49:10,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:49:10,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:49:10,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:49:10,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:49:10,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:49:10,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:49:10,696 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:49:10,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:49:10,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:49:11,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:49:11,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:49:11,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:49:11,012 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:49:11,013 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-26 22:49:11,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3c0ab46/a48a839ac53c49af9e363293924828f0/FLAG09b1a18ab [2019-12-26 22:49:11,599 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:49:11,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_tso.oepc.i [2019-12-26 22:49:11,624 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3c0ab46/a48a839ac53c49af9e363293924828f0/FLAG09b1a18ab [2019-12-26 22:49:11,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea3c0ab46/a48a839ac53c49af9e363293924828f0 [2019-12-26 22:49:11,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:49:11,927 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:49:11,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:49:11,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:49:11,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:49:11,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:49:11" (1/1) ... [2019-12-26 22:49:11,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@256d980f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:11, skipping insertion in model container [2019-12-26 22:49:11,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:49:11" (1/1) ... [2019-12-26 22:49:11,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:49:12,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:49:12,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:49:12,530 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:49:12,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:49:12,696 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:49:12,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12 WrapperNode [2019-12-26 22:49:12,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:49:12,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:49:12,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:49:12,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:49:12,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:49:12,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:49:12,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:49:12,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:49:12,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (1/1) ... [2019-12-26 22:49:12,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:49:12,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:49:12,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:49:12,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:49:12,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (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-26 22:49:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:49:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:49:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:49:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:49:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:49:12,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:49:12,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:49:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:49:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:49:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:49:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:49:12,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:49:12,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:49:12,862 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:49:13,618 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:49:13,619 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:49:13,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:49:13 BoogieIcfgContainer [2019-12-26 22:49:13,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:49:13,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:49:13,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:49:13,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:49:13,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:49:11" (1/3) ... [2019-12-26 22:49:13,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88cb693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:49:13, skipping insertion in model container [2019-12-26 22:49:13,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:49:12" (2/3) ... [2019-12-26 22:49:13,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88cb693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:49:13, skipping insertion in model container [2019-12-26 22:49:13,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:49:13" (3/3) ... [2019-12-26 22:49:13,632 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_tso.oepc.i [2019-12-26 22:49:13,642 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:49:13,642 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:49:13,649 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:49:13,650 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:49:13,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,727 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,728 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,757 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,771 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,772 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:49:13,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:49:13,818 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:49:13,818 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:49:13,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:49:13,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:49:13,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:49:13,818 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:49:13,818 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:49:13,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:49:13,838 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 22:49:13,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:49:13,957 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:49:13,958 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:49:13,974 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:49:13,997 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:49:14,078 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:49:14,079 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:49:14,089 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:49:14,109 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:49:14,111 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:49:19,320 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:49:19,439 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:49:19,795 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-26 22:49:19,795 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-26 22:49:19,799 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 22:49:42,378 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-26 22:49:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-26 22:49:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:49:42,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:49:42,386 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:49:42,386 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-26 22:49:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:49:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-26 22:49:42,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:49:42,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932176810] [2019-12-26 22:49:42,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:49:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:49:42,703 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-26 22:49:42,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932176810] [2019-12-26 22:49:42,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:49:42,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:49:42,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138228013] [2019-12-26 22:49:42,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:49:42,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:49:42,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:49:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:49:42,728 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-26 22:49:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:49:46,611 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-26 22:49:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:49:46,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:49:46,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:49:47,410 INFO L225 Difference]: With dead ends: 125570 [2019-12-26 22:49:47,411 INFO L226 Difference]: Without dead ends: 111010 [2019-12-26 22:49:47,412 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-26 22:49:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-26 22:49:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-26 22:49:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-26 22:50:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-26 22:50:01,923 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-26 22:50:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:01,923 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-26 22:50:01,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:50:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-26 22:50:01,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:50:01,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:01,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:50:01,940 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-26 22:50:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-26 22:50:01,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:01,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123967516] [2019-12-26 22:50:01,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:50:02,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123967516] [2019-12-26 22:50:02,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:02,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:50:02,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87524677] [2019-12-26 22:50:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:50:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:50:02,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:50:02,033 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-26 22:50:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:03,388 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-26 22:50:03,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:50:03,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:50:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:09,517 INFO L225 Difference]: With dead ends: 172646 [2019-12-26 22:50:09,518 INFO L226 Difference]: Without dead ends: 172548 [2019-12-26 22:50:09,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:50:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-26 22:50:17,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-26 22:50:17,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-26 22:50:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-26 22:50:25,129 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-26 22:50:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:25,129 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-26 22:50:25,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:50:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-26 22:50:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:50:25,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:25,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:50:25,133 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-26 22:50:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-26 22:50:25,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:25,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264887460] [2019-12-26 22:50:25,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:25,213 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-26 22:50:25,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264887460] [2019-12-26 22:50:25,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:25,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:50:25,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267285644] [2019-12-26 22:50:25,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:50:25,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:25,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:50:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:50:25,217 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-26 22:50:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:25,342 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-26 22:50:25,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:50:25,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:50:25,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:25,397 INFO L225 Difference]: With dead ends: 34208 [2019-12-26 22:50:25,397 INFO L226 Difference]: Without dead ends: 34208 [2019-12-26 22:50:25,398 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-26 22:50:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-26 22:50:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-26 22:50:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-26 22:50:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-26 22:50:26,017 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-26 22:50:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:26,018 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-26 22:50:26,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:50:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-26 22:50:26,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:50:26,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:26,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:50:26,021 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-26 22:50:26,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:26,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-26 22:50:26,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:26,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825548153] [2019-12-26 22:50:26,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:26,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:50:26,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825548153] [2019-12-26 22:50:26,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:26,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:50:26,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284602434] [2019-12-26 22:50:26,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:50:26,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:50:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:50:26,076 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-26 22:50:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:26,277 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-26 22:50:26,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:50:26,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:50:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:26,368 INFO L225 Difference]: With dead ends: 51809 [2019-12-26 22:50:26,368 INFO L226 Difference]: Without dead ends: 51809 [2019-12-26 22:50:26,368 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-26 22:50:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-26 22:50:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-26 22:50:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-26 22:50:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-26 22:50:28,178 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-26 22:50:28,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:28,179 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-26 22:50:28,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:50:28,179 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-26 22:50:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:50:28,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:28,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:50:28,183 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-26 22:50:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-26 22:50:28,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:28,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939011175] [2019-12-26 22:50:28,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:28,284 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-26 22:50:28,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939011175] [2019-12-26 22:50:28,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:28,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:50:28,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953945381] [2019-12-26 22:50:28,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:50:28,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:28,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:50:28,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:50:28,286 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-26 22:50:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:28,867 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-26 22:50:28,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:50:28,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 22:50:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:28,954 INFO L225 Difference]: With dead ends: 53507 [2019-12-26 22:50:28,955 INFO L226 Difference]: Without dead ends: 53507 [2019-12-26 22:50:28,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:50:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-26 22:50:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-26 22:50:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-26 22:50:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-26 22:50:30,412 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-26 22:50:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:30,412 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-26 22:50:30,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:50:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-26 22:50:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:50:30,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:30,426 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-26 22:50:30,426 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-26 22:50:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-26 22:50:30,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:30,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367276856] [2019-12-26 22:50:30,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:30,513 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-26 22:50:30,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367276856] [2019-12-26 22:50:30,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:30,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:50:30,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850645992] [2019-12-26 22:50:30,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:50:30,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:50:30,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:50:30,515 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-26 22:50:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:31,494 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-26 22:50:31,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:50:31,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 22:50:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:31,607 INFO L225 Difference]: With dead ends: 66834 [2019-12-26 22:50:31,607 INFO L226 Difference]: Without dead ends: 66820 [2019-12-26 22:50:31,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:50:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-26 22:50:33,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-26 22:50:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-26 22:50:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-26 22:50:33,255 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-26 22:50:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:33,255 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-26 22:50:33,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:50:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-26 22:50:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:50:33,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:33,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] [2019-12-26 22:50:33,273 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-26 22:50:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:33,274 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-26 22:50:33,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:33,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297811978] [2019-12-26 22:50:33,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:33,360 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-26 22:50:33,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297811978] [2019-12-26 22:50:33,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:33,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:50:33,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747071418] [2019-12-26 22:50:33,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:50:33,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:33,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:50:33,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:50:33,362 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-26 22:50:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:33,457 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-26 22:50:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:50:33,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:50:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:33,492 INFO L225 Difference]: With dead ends: 18127 [2019-12-26 22:50:33,493 INFO L226 Difference]: Without dead ends: 18127 [2019-12-26 22:50:33,493 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-26 22:50:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-26 22:50:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-26 22:50:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-26 22:50:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-26 22:50:33,790 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-26 22:50:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:33,791 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-26 22:50:33,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:50:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-26 22:50:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 22:50:33,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:33,805 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-26 22:50:33,805 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-26 22:50:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-26 22:50:33,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:33,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965355832] [2019-12-26 22:50:33,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:33,920 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-26 22:50:33,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965355832] [2019-12-26 22:50:33,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:33,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:50:33,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16132924] [2019-12-26 22:50:33,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:50:33,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:33,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:50:33,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:50:33,922 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-26 22:50:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:34,583 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-26 22:50:34,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:50:34,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 22:50:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:34,632 INFO L225 Difference]: With dead ends: 25206 [2019-12-26 22:50:34,633 INFO L226 Difference]: Without dead ends: 25206 [2019-12-26 22:50:34,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:50:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-26 22:50:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-26 22:50:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-26 22:50:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-26 22:50:35,033 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-26 22:50:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:35,034 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-26 22:50:35,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:50:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-26 22:50:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 22:50:35,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:35,056 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-26 22:50:35,056 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-26 22:50:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:35,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-26 22:50:35,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:35,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785520219] [2019-12-26 22:50:35,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:35,159 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-26 22:50:35,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785520219] [2019-12-26 22:50:35,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:35,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:50:35,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531628476] [2019-12-26 22:50:35,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:50:35,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:35,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:50:35,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:50:35,161 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-26 22:50:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:36,792 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-26 22:50:36,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:50:36,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 22:50:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:36,835 INFO L225 Difference]: With dead ends: 28185 [2019-12-26 22:50:36,835 INFO L226 Difference]: Without dead ends: 28185 [2019-12-26 22:50:36,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 22:50:36,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-26 22:50:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-26 22:50:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-26 22:50:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-26 22:50:37,209 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-26 22:50:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:37,210 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-26 22:50:37,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:50:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-26 22:50:37,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:50:37,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:37,237 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-26 22:50:37,237 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-26 22:50:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:37,238 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-26 22:50:37,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:37,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150597754] [2019-12-26 22:50:37,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:37,323 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-26 22:50:37,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150597754] [2019-12-26 22:50:37,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:37,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:50:37,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132680870] [2019-12-26 22:50:37,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:50:37,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:50:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:50:37,325 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 3 states. [2019-12-26 22:50:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:37,407 INFO L93 Difference]: Finished difference Result 18532 states and 56133 transitions. [2019-12-26 22:50:37,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:50:37,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:50:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:37,432 INFO L225 Difference]: With dead ends: 18532 [2019-12-26 22:50:37,432 INFO L226 Difference]: Without dead ends: 18532 [2019-12-26 22:50:37,432 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-26 22:50:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18532 states. [2019-12-26 22:50:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18532 to 18524. [2019-12-26 22:50:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2019-12-26 22:50:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56117 transitions. [2019-12-26 22:50:37,710 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56117 transitions. Word has length 39 [2019-12-26 22:50:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:37,711 INFO L462 AbstractCegarLoop]: Abstraction has 18524 states and 56117 transitions. [2019-12-26 22:50:37,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:50:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56117 transitions. [2019-12-26 22:50:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:50:37,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:37,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:50:37,733 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-26 22:50:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:37,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1220902187, now seen corresponding path program 1 times [2019-12-26 22:50:37,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:37,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211911996] [2019-12-26 22:50:37,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:37,803 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-26 22:50:37,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211911996] [2019-12-26 22:50:37,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:37,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:50:37,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796375051] [2019-12-26 22:50:37,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:50:37,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:50:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:50:37,805 INFO L87 Difference]: Start difference. First operand 18524 states and 56117 transitions. Second operand 5 states. [2019-12-26 22:50:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:37,890 INFO L93 Difference]: Finished difference Result 17291 states and 53251 transitions. [2019-12-26 22:50:37,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:50:37,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:50:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:37,918 INFO L225 Difference]: With dead ends: 17291 [2019-12-26 22:50:37,919 INFO L226 Difference]: Without dead ends: 17291 [2019-12-26 22:50:37,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:50:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17291 states. [2019-12-26 22:50:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17291 to 16710. [2019-12-26 22:50:38,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-26 22:50:38,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 51682 transitions. [2019-12-26 22:50:38,200 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 51682 transitions. Word has length 40 [2019-12-26 22:50:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:38,200 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 51682 transitions. [2019-12-26 22:50:38,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:50:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 51682 transitions. [2019-12-26 22:50:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:50:38,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:38,217 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-26 22:50:38,218 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-26 22:50:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:38,218 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-26 22:50:38,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:38,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305308461] [2019-12-26 22:50:38,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:38,328 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-26 22:50:38,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305308461] [2019-12-26 22:50:38,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:38,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:50:38,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217261347] [2019-12-26 22:50:38,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:50:38,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:38,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:50:38,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:50:38,331 INFO L87 Difference]: Start difference. First operand 16710 states and 51682 transitions. Second operand 3 states. [2019-12-26 22:50:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:38,428 INFO L93 Difference]: Finished difference Result 20999 states and 64475 transitions. [2019-12-26 22:50:38,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:50:38,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:50:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:38,455 INFO L225 Difference]: With dead ends: 20999 [2019-12-26 22:50:38,455 INFO L226 Difference]: Without dead ends: 20999 [2019-12-26 22:50:38,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:50:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20999 states. [2019-12-26 22:50:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20999 to 17838. [2019-12-26 22:50:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17838 states. [2019-12-26 22:50:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17838 states to 17838 states and 55279 transitions. [2019-12-26 22:50:39,172 INFO L78 Accepts]: Start accepts. Automaton has 17838 states and 55279 transitions. Word has length 65 [2019-12-26 22:50:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:39,172 INFO L462 AbstractCegarLoop]: Abstraction has 17838 states and 55279 transitions. [2019-12-26 22:50:39,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:50:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 17838 states and 55279 transitions. [2019-12-26 22:50:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:39,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:39,192 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-26 22:50:39,192 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-26 22:50:39,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:39,193 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-26 22:50:39,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:39,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621681794] [2019-12-26 22:50:39,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:39,277 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-26 22:50:39,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621681794] [2019-12-26 22:50:39,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:39,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:50:39,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958139549] [2019-12-26 22:50:39,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:50:39,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:39,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:50:39,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:50:39,279 INFO L87 Difference]: Start difference. First operand 17838 states and 55279 transitions. Second operand 4 states. [2019-12-26 22:50:39,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:39,440 INFO L93 Difference]: Finished difference Result 21261 states and 65410 transitions. [2019-12-26 22:50:39,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:50:39,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 22:50:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:39,469 INFO L225 Difference]: With dead ends: 21261 [2019-12-26 22:50:39,470 INFO L226 Difference]: Without dead ends: 21261 [2019-12-26 22:50:39,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:50:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21261 states. [2019-12-26 22:50:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21261 to 17865. [2019-12-26 22:50:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17865 states. [2019-12-26 22:50:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17865 states to 17865 states and 55278 transitions. [2019-12-26 22:50:39,783 INFO L78 Accepts]: Start accepts. Automaton has 17865 states and 55278 transitions. Word has length 66 [2019-12-26 22:50:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:39,783 INFO L462 AbstractCegarLoop]: Abstraction has 17865 states and 55278 transitions. [2019-12-26 22:50:39,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:50:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17865 states and 55278 transitions. [2019-12-26 22:50:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:39,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:39,809 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-26 22:50:39,809 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-26 22:50:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-26 22:50:39,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:39,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055982334] [2019-12-26 22:50:39,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:40,051 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-26 22:50:40,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055982334] [2019-12-26 22:50:40,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:40,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:50:40,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873205170] [2019-12-26 22:50:40,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:50:40,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:40,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:50:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:50:40,053 INFO L87 Difference]: Start difference. First operand 17865 states and 55278 transitions. Second operand 10 states. [2019-12-26 22:50:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:42,281 INFO L93 Difference]: Finished difference Result 41608 states and 128455 transitions. [2019-12-26 22:50:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:50:42,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 22:50:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:42,323 INFO L225 Difference]: With dead ends: 41608 [2019-12-26 22:50:42,323 INFO L226 Difference]: Without dead ends: 28443 [2019-12-26 22:50:42,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:50:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28443 states. [2019-12-26 22:50:43,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28443 to 20934. [2019-12-26 22:50:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20934 states. [2019-12-26 22:50:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20934 states to 20934 states and 64596 transitions. [2019-12-26 22:50:43,180 INFO L78 Accepts]: Start accepts. Automaton has 20934 states and 64596 transitions. Word has length 66 [2019-12-26 22:50:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:43,180 INFO L462 AbstractCegarLoop]: Abstraction has 20934 states and 64596 transitions. [2019-12-26 22:50:43,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:50:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20934 states and 64596 transitions. [2019-12-26 22:50:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:43,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:43,200 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-26 22:50:43,200 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-26 22:50:43,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-26 22:50:43,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:43,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298319956] [2019-12-26 22:50:43,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:43,410 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-26 22:50:43,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298319956] [2019-12-26 22:50:43,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:43,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:50:43,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524279322] [2019-12-26 22:50:43,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:50:43,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:50:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:50:43,412 INFO L87 Difference]: Start difference. First operand 20934 states and 64596 transitions. Second operand 10 states. [2019-12-26 22:50:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:45,315 INFO L93 Difference]: Finished difference Result 36359 states and 111312 transitions. [2019-12-26 22:50:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:50:45,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 22:50:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:45,371 INFO L225 Difference]: With dead ends: 36359 [2019-12-26 22:50:45,371 INFO L226 Difference]: Without dead ends: 30399 [2019-12-26 22:50:45,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:50:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30399 states. [2019-12-26 22:50:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30399 to 21386. [2019-12-26 22:50:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21386 states. [2019-12-26 22:50:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21386 states to 21386 states and 65844 transitions. [2019-12-26 22:50:45,776 INFO L78 Accepts]: Start accepts. Automaton has 21386 states and 65844 transitions. Word has length 66 [2019-12-26 22:50:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:45,776 INFO L462 AbstractCegarLoop]: Abstraction has 21386 states and 65844 transitions. [2019-12-26 22:50:45,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:50:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21386 states and 65844 transitions. [2019-12-26 22:50:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:45,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:45,796 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-26 22:50:45,796 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-26 22:50:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-26 22:50:45,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:45,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798503956] [2019-12-26 22:50:45,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:50:45,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798503956] [2019-12-26 22:50:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:50:45,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562303441] [2019-12-26 22:50:45,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:50:45,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:50:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:50:45,982 INFO L87 Difference]: Start difference. First operand 21386 states and 65844 transitions. Second operand 11 states. [2019-12-26 22:50:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:48,399 INFO L93 Difference]: Finished difference Result 33042 states and 101402 transitions. [2019-12-26 22:50:48,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:50:48,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:50:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:48,441 INFO L225 Difference]: With dead ends: 33042 [2019-12-26 22:50:48,441 INFO L226 Difference]: Without dead ends: 29559 [2019-12-26 22:50:48,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:50:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29559 states. [2019-12-26 22:50:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29559 to 20954. [2019-12-26 22:50:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20954 states. [2019-12-26 22:50:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20954 states to 20954 states and 64512 transitions. [2019-12-26 22:50:48,830 INFO L78 Accepts]: Start accepts. Automaton has 20954 states and 64512 transitions. Word has length 66 [2019-12-26 22:50:48,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:48,830 INFO L462 AbstractCegarLoop]: Abstraction has 20954 states and 64512 transitions. [2019-12-26 22:50:48,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:50:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 20954 states and 64512 transitions. [2019-12-26 22:50:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:48,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:48,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:50:48,852 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-26 22:50:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-26 22:50:48,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:48,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784347647] [2019-12-26 22:50:48,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:49,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-26 22:50:49,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784347647] [2019-12-26 22:50:49,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:49,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:50:49,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202767443] [2019-12-26 22:50:49,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:50:49,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:50:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:50:49,035 INFO L87 Difference]: Start difference. First operand 20954 states and 64512 transitions. Second operand 11 states. [2019-12-26 22:50:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:51,164 INFO L93 Difference]: Finished difference Result 34053 states and 104143 transitions. [2019-12-26 22:50:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 22:50:51,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:50:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:51,206 INFO L225 Difference]: With dead ends: 34053 [2019-12-26 22:50:51,206 INFO L226 Difference]: Without dead ends: 29681 [2019-12-26 22:50:51,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:50:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29681 states. [2019-12-26 22:50:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29681 to 21178. [2019-12-26 22:50:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21178 states. [2019-12-26 22:50:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21178 states to 21178 states and 65096 transitions. [2019-12-26 22:50:51,605 INFO L78 Accepts]: Start accepts. Automaton has 21178 states and 65096 transitions. Word has length 66 [2019-12-26 22:50:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:51,605 INFO L462 AbstractCegarLoop]: Abstraction has 21178 states and 65096 transitions. [2019-12-26 22:50:51,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:50:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 21178 states and 65096 transitions. [2019-12-26 22:50:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:51,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:51,629 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-26 22:50:51,629 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-26 22:50:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 791396238, now seen corresponding path program 5 times [2019-12-26 22:50:51,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:51,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403769889] [2019-12-26 22:50:51,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:51,800 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-26 22:50:51,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403769889] [2019-12-26 22:50:51,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:51,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:50:51,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408773793] [2019-12-26 22:50:51,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:50:51,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:51,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:50:51,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:50:51,802 INFO L87 Difference]: Start difference. First operand 21178 states and 65096 transitions. Second operand 12 states. [2019-12-26 22:50:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:54,274 INFO L93 Difference]: Finished difference Result 31865 states and 97419 transitions. [2019-12-26 22:50:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 22:50:54,275 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:50:54,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:54,316 INFO L225 Difference]: With dead ends: 31865 [2019-12-26 22:50:54,317 INFO L226 Difference]: Without dead ends: 30127 [2019-12-26 22:50:54,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:50:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30127 states. [2019-12-26 22:50:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30127 to 21044. [2019-12-26 22:50:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21044 states. [2019-12-26 22:50:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 64748 transitions. [2019-12-26 22:50:54,738 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 64748 transitions. Word has length 66 [2019-12-26 22:50:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:54,739 INFO L462 AbstractCegarLoop]: Abstraction has 21044 states and 64748 transitions. [2019-12-26 22:50:54,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:50:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 64748 transitions. [2019-12-26 22:50:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:54,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:54,762 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-26 22:50:54,762 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-26 22:50:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash -315236056, now seen corresponding path program 6 times [2019-12-26 22:50:54,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:54,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606189803] [2019-12-26 22:50:54,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:54,938 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-26 22:50:54,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606189803] [2019-12-26 22:50:54,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:54,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:50:54,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028547390] [2019-12-26 22:50:54,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:50:54,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:50:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:50:54,941 INFO L87 Difference]: Start difference. First operand 21044 states and 64748 transitions. Second operand 12 states. [2019-12-26 22:50:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:50:58,258 INFO L93 Difference]: Finished difference Result 38498 states and 117095 transitions. [2019-12-26 22:50:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 22:50:58,258 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:50:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:50:58,305 INFO L225 Difference]: With dead ends: 38498 [2019-12-26 22:50:58,305 INFO L226 Difference]: Without dead ends: 32776 [2019-12-26 22:50:58,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 22:50:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32776 states. [2019-12-26 22:50:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32776 to 20807. [2019-12-26 22:50:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20807 states. [2019-12-26 22:50:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20807 states to 20807 states and 63903 transitions. [2019-12-26 22:50:59,194 INFO L78 Accepts]: Start accepts. Automaton has 20807 states and 63903 transitions. Word has length 66 [2019-12-26 22:50:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:50:59,194 INFO L462 AbstractCegarLoop]: Abstraction has 20807 states and 63903 transitions. [2019-12-26 22:50:59,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:50:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 20807 states and 63903 transitions. [2019-12-26 22:50:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:50:59,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:50:59,215 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-26 22:50:59,215 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-26 22:50:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:50:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash 99317356, now seen corresponding path program 7 times [2019-12-26 22:50:59,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:50:59,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70981650] [2019-12-26 22:50:59,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:50:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:50:59,403 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-26 22:50:59,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70981650] [2019-12-26 22:50:59,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:50:59,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:50:59,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137212498] [2019-12-26 22:50:59,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:50:59,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:50:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:50:59,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:50:59,405 INFO L87 Difference]: Start difference. First operand 20807 states and 63903 transitions. Second operand 11 states. [2019-12-26 22:51:01,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:51:01,541 INFO L93 Difference]: Finished difference Result 33268 states and 101259 transitions. [2019-12-26 22:51:01,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:51:01,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 22:51:01,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:51:01,586 INFO L225 Difference]: With dead ends: 33268 [2019-12-26 22:51:01,586 INFO L226 Difference]: Without dead ends: 32041 [2019-12-26 22:51:01,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:51:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32041 states. [2019-12-26 22:51:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32041 to 20711. [2019-12-26 22:51:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20711 states. [2019-12-26 22:51:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20711 states to 20711 states and 63639 transitions. [2019-12-26 22:51:02,007 INFO L78 Accepts]: Start accepts. Automaton has 20711 states and 63639 transitions. Word has length 66 [2019-12-26 22:51:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:51:02,007 INFO L462 AbstractCegarLoop]: Abstraction has 20711 states and 63639 transitions. [2019-12-26 22:51:02,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:51:02,007 INFO L276 IsEmpty]: Start isEmpty. Operand 20711 states and 63639 transitions. [2019-12-26 22:51:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:51:02,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:51:02,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:51:02,027 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-26 22:51:02,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:51:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -296830018, now seen corresponding path program 8 times [2019-12-26 22:51:02,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:51:02,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84571705] [2019-12-26 22:51:02,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:51:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:51:02,099 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-26 22:51:02,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84571705] [2019-12-26 22:51:02,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:51:02,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:51:02,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988157718] [2019-12-26 22:51:02,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:51:02,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:51:02,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:51:02,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:51:02,101 INFO L87 Difference]: Start difference. First operand 20711 states and 63639 transitions. Second operand 6 states. [2019-12-26 22:51:02,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:51:02,476 INFO L93 Difference]: Finished difference Result 55015 states and 167162 transitions. [2019-12-26 22:51:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:51:02,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-26 22:51:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:51:02,534 INFO L225 Difference]: With dead ends: 55015 [2019-12-26 22:51:02,534 INFO L226 Difference]: Without dead ends: 42489 [2019-12-26 22:51:02,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:51:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42489 states. [2019-12-26 22:51:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42489 to 21570. [2019-12-26 22:51:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21570 states. [2019-12-26 22:51:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21570 states to 21570 states and 66256 transitions. [2019-12-26 22:51:03,585 INFO L78 Accepts]: Start accepts. Automaton has 21570 states and 66256 transitions. Word has length 66 [2019-12-26 22:51:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:51:03,585 INFO L462 AbstractCegarLoop]: Abstraction has 21570 states and 66256 transitions. [2019-12-26 22:51:03,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:51:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 21570 states and 66256 transitions. [2019-12-26 22:51:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:51:03,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:51:03,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:51:03,609 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-26 22:51:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:51:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1527279588, now seen corresponding path program 9 times [2019-12-26 22:51:03,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:51:03,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162173684] [2019-12-26 22:51:03,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:51:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:51:03,819 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-26 22:51:03,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162173684] [2019-12-26 22:51:03,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:51:03,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:51:03,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091601570] [2019-12-26 22:51:03,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:51:03,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:51:03,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:51:03,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:51:03,821 INFO L87 Difference]: Start difference. First operand 21570 states and 66256 transitions. Second operand 12 states. [2019-12-26 22:51:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:51:07,982 INFO L93 Difference]: Finished difference Result 46081 states and 138393 transitions. [2019-12-26 22:51:07,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-26 22:51:07,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:51:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:51:08,043 INFO L225 Difference]: With dead ends: 46081 [2019-12-26 22:51:08,043 INFO L226 Difference]: Without dead ends: 45861 [2019-12-26 22:51:08,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=1470, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 22:51:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45861 states. [2019-12-26 22:51:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45861 to 32071. [2019-12-26 22:51:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32071 states. [2019-12-26 22:51:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32071 states to 32071 states and 97688 transitions. [2019-12-26 22:51:08,685 INFO L78 Accepts]: Start accepts. Automaton has 32071 states and 97688 transitions. Word has length 66 [2019-12-26 22:51:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:51:08,686 INFO L462 AbstractCegarLoop]: Abstraction has 32071 states and 97688 transitions. [2019-12-26 22:51:08,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:51:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 32071 states and 97688 transitions. [2019-12-26 22:51:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:51:08,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:51:08,718 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-26 22:51:08,718 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-26 22:51:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:51:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash 983480798, now seen corresponding path program 10 times [2019-12-26 22:51:08,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:51:08,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828492555] [2019-12-26 22:51:08,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:51:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:51:08,786 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-26 22:51:08,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828492555] [2019-12-26 22:51:08,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:51:08,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:51:08,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383011960] [2019-12-26 22:51:08,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:51:08,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:51:08,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:51:08,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:51:08,791 INFO L87 Difference]: Start difference. First operand 32071 states and 97688 transitions. Second operand 3 states. [2019-12-26 22:51:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:51:08,944 INFO L93 Difference]: Finished difference Result 32071 states and 97687 transitions. [2019-12-26 22:51:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:51:08,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:51:08,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:51:09,016 INFO L225 Difference]: With dead ends: 32071 [2019-12-26 22:51:09,016 INFO L226 Difference]: Without dead ends: 32071 [2019-12-26 22:51:09,016 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-26 22:51:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32071 states. [2019-12-26 22:51:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32071 to 26712. [2019-12-26 22:51:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26712 states. [2019-12-26 22:51:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26712 states to 26712 states and 82428 transitions. [2019-12-26 22:51:10,288 INFO L78 Accepts]: Start accepts. Automaton has 26712 states and 82428 transitions. Word has length 66 [2019-12-26 22:51:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:51:10,288 INFO L462 AbstractCegarLoop]: Abstraction has 26712 states and 82428 transitions. [2019-12-26 22:51:10,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:51:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26712 states and 82428 transitions. [2019-12-26 22:51:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:51:10,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:51:10,317 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-26 22:51:10,318 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-26 22:51:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:51:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 1 times [2019-12-26 22:51:10,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:51:10,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545707816] [2019-12-26 22:51:10,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:51:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:51:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:51:10,474 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:51:10,474 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:51:10,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= (select .cse0 |v_ULTIMATE.start_main_~#t1315~0.base_23|) 0) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1315~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1315~0.base_23|) |v_ULTIMATE.start_main_~#t1315~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1315~0.base_23| 4)) (= v_~main$tmp_guard1~0_48 0) (= |v_ULTIMATE.start_main_~#t1315~0.offset_17| 0) (= 0 v_~z$r_buff0_thd3~0_416) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1315~0.base_23|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1315~0.base_23| 1)) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1317~0.base=|v_ULTIMATE.start_main_~#t1317~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1317~0.offset=|v_ULTIMATE.start_main_~#t1317~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ULTIMATE.start_main_~#t1315~0.offset=|v_ULTIMATE.start_main_~#t1315~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~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_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ULTIMATE.start_main_~#t1316~0.offset=|v_ULTIMATE.start_main_~#t1316~0.offset_12|, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1316~0.base=|v_ULTIMATE.start_main_~#t1316~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1315~0.base=|v_ULTIMATE.start_main_~#t1315~0.base_23|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1317~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1317~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1315~0.offset, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1316~0.offset, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1316~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~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_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1315~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:51:10,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1316~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1316~0.base_11|) |v_ULTIMATE.start_main_~#t1316~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1316~0.base_11| 4) |v_#length_17|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1316~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1316~0.offset_9|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1316~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1316~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1316~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1316~0.base=|v_ULTIMATE.start_main_~#t1316~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1316~0.offset=|v_ULTIMATE.start_main_~#t1316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1316~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1316~0.offset] because there is no mapped edge [2019-12-26 22:51:10,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} 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-26 22:51:10,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1902414428 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1902414428 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1902414428| ~z$w_buff1~0_In1902414428) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1902414428| ~z~0_In1902414428) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1902414428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902414428, ~z$w_buff1~0=~z$w_buff1~0_In1902414428, ~z~0=~z~0_In1902414428} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1902414428|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1902414428, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902414428, ~z$w_buff1~0=~z$w_buff1~0_In1902414428, ~z~0=~z~0_In1902414428} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 22:51:10,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 22:51:10,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1317~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1317~0.base_13|) |v_ULTIMATE.start_main_~#t1317~0.offset_11| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1317~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1317~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1317~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1317~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1317~0.base_13|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1317~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1317~0.base=|v_ULTIMATE.start_main_~#t1317~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1317~0.offset=|v_ULTIMATE.start_main_~#t1317~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1317~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1317~0.offset] because there is no mapped edge [2019-12-26 22:51:10,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-629493524 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-629493524 256)))) (or (and (= ~z$w_buff0_used~0_In-629493524 |P1Thread1of1ForFork2_#t~ite11_Out-629493524|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-629493524|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-629493524, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-629493524} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-629493524, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-629493524|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-629493524} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:51:10,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In437115276 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In437115276 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In437115276 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In437115276 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In437115276 |P1Thread1of1ForFork2_#t~ite12_Out437115276|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out437115276|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In437115276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In437115276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In437115276, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In437115276} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In437115276, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In437115276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In437115276, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out437115276|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In437115276} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:51:10,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1447611284 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1447611284 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1447611284|) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-1447611284 |P1Thread1of1ForFork2_#t~ite13_Out-1447611284|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1447611284, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1447611284} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1447611284, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1447611284|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1447611284} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:51:10,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-881434438 256) 0))) (or (and (= ~z$w_buff0_used~0_In-881434438 |P2Thread1of1ForFork0_#t~ite26_Out-881434438|) (= |P2Thread1of1ForFork0_#t~ite26_Out-881434438| |P2Thread1of1ForFork0_#t~ite27_Out-881434438|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-881434438 256) 0))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-881434438 256) 0)) (= (mod ~z$w_buff0_used~0_In-881434438 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In-881434438 256) 0))))) (and (= ~z$w_buff0_used~0_In-881434438 |P2Thread1of1ForFork0_#t~ite27_Out-881434438|) (= |P2Thread1of1ForFork0_#t~ite26_In-881434438| |P2Thread1of1ForFork0_#t~ite26_Out-881434438|) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-881434438|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-881434438, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-881434438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-881434438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-881434438, ~weak$$choice2~0=~weak$$choice2~0_In-881434438} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-881434438|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-881434438|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-881434438, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-881434438, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-881434438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-881434438, ~weak$$choice2~0=~weak$$choice2~0_In-881434438} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 22:51:10,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 22:51:10,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In170356200 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In170356200 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out170356200|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In170356200 |P0Thread1of1ForFork1_#t~ite5_Out170356200|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In170356200, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In170356200} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out170356200|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In170356200, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In170356200} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:51:10,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:51:10,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out-1212042080| |P2Thread1of1ForFork0_#t~ite39_Out-1212042080|)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1212042080 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1212042080 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1212042080| ~z~0_In-1212042080) (or .cse0 .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1212042080| ~z$w_buff1~0_In-1212042080) .cse2 (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1212042080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1212042080, ~z$w_buff1~0=~z$w_buff1~0_In-1212042080, ~z~0=~z~0_In-1212042080} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1212042080|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1212042080|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1212042080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1212042080, ~z$w_buff1~0=~z$w_buff1~0_In-1212042080, ~z~0=~z~0_In-1212042080} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:51:10,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1763427552 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1763427552 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out1763427552| ~z$w_buff0_used~0_In1763427552) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1763427552| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1763427552, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1763427552} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1763427552, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1763427552|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1763427552} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:51:10,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-577402713 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-577402713 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-577402713 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-577402713 256)))) (or (and (= ~z$w_buff1_used~0_In-577402713 |P2Thread1of1ForFork0_#t~ite41_Out-577402713|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-577402713|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-577402713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-577402713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577402713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-577402713} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-577402713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-577402713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-577402713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-577402713, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-577402713|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:51:10,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-425471973 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-425471973 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-425471973| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-425471973| ~z$r_buff0_thd3~0_In-425471973) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-425471973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-425471973} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-425471973, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-425471973, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-425471973|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:51:10,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1001384511 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1001384511 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1001384511 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1001384511 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1001384511| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-1001384511 |P2Thread1of1ForFork0_#t~ite43_Out-1001384511|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1001384511, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1001384511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1001384511, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1001384511} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1001384511|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1001384511, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1001384511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1001384511, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1001384511} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:51:10,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, 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-26 22:51:10,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1033101849 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1033101849 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1033101849 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1033101849 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1033101849|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1033101849 |P0Thread1of1ForFork1_#t~ite6_Out-1033101849|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1033101849, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1033101849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033101849, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1033101849} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1033101849, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1033101849|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1033101849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1033101849, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1033101849} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:51:10,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In12072301 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In12072301 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out12072301) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In12072301 ~z$r_buff0_thd1~0_Out12072301) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In12072301, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In12072301} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In12072301, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out12072301|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out12072301} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:51:10,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1566723939 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1566723939 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1566723939 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1566723939 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1566723939| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out1566723939| ~z$r_buff1_thd1~0_In1566723939) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1566723939, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1566723939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1566723939, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1566723939} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1566723939|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1566723939, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1566723939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1566723939, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1566723939} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:51:10,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} 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-26 22:51:10,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-72220918 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-72220918 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-72220918 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-72220918 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-72220918| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-72220918| ~z$r_buff1_thd2~0_In-72220918)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-72220918, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-72220918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72220918, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-72220918} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-72220918, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-72220918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-72220918, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-72220918|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-72220918} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:51:10,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, 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-26 22:51:10,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: 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-26 22:51:10,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-1274983565| |ULTIMATE.start_main_#t~ite47_Out-1274983565|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1274983565 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1274983565 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1274983565 |ULTIMATE.start_main_#t~ite47_Out-1274983565|)) (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1274983565| ~z$w_buff1~0_In-1274983565) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1274983565, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1274983565, ~z$w_buff1~0=~z$w_buff1~0_In-1274983565, ~z~0=~z~0_In-1274983565} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1274983565, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1274983565|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1274983565, ~z$w_buff1~0=~z$w_buff1~0_In-1274983565, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1274983565|, ~z~0=~z~0_In-1274983565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:51:10,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-753769744 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-753769744 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-753769744| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-753769744| ~z$w_buff0_used~0_In-753769744) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-753769744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-753769744} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-753769744, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-753769744, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-753769744|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:51:10,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-550779284 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-550779284 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-550779284 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-550779284 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-550779284| ~z$w_buff1_used~0_In-550779284)) (and (= |ULTIMATE.start_main_#t~ite50_Out-550779284| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-550779284, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-550779284, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-550779284, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-550779284} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-550779284|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-550779284, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-550779284, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-550779284, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-550779284} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:51:10,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In205698870 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In205698870 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In205698870 |ULTIMATE.start_main_#t~ite51_Out205698870|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out205698870| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In205698870, ~z$w_buff0_used~0=~z$w_buff0_used~0_In205698870} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In205698870, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out205698870|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In205698870} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:51:10,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1841348725 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1841348725 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1841348725 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1841348725 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1841348725| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1841348725| ~z$r_buff1_thd0~0_In1841348725)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1841348725, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1841348725, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1841348725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1841348725} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1841348725|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1841348725, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1841348725, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1841348725, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1841348725} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:51:10,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:51:10,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:51:10 BasicIcfg [2019-12-26 22:51:10,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:51:10,638 INFO L168 Benchmark]: Toolchain (without parser) took 118708.43 ms. Allocated memory was 141.6 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 101.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 22:51:10,638 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 141.6 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 22:51:10,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.77 ms. Allocated memory was 141.6 MB in the beginning and 202.9 MB in the end (delta: 61.3 MB). Free memory was 100.7 MB in the beginning and 156.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:51:10,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.33 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:51:10,640 INFO L168 Benchmark]: Boogie Preprocessor took 39.40 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:51:10,640 INFO L168 Benchmark]: RCFGBuilder took 821.77 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 100.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:51:10,641 INFO L168 Benchmark]: TraceAbstraction took 117011.83 ms. Allocated memory was 202.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 100.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-26 22:51:10,643 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.36 ms. Allocated memory is still 141.6 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.77 ms. Allocated memory was 141.6 MB in the beginning and 202.9 MB in the end (delta: 61.3 MB). Free memory was 100.7 MB in the beginning and 156.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.33 ms. Allocated memory is still 202.9 MB. Free memory was 156.5 MB in the beginning and 153.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.40 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 150.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.77 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 100.9 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117011.83 ms. Allocated memory was 202.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 100.9 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] 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_p2_EAX=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] [L824] FCALL, FORK 0 pthread_create(&t1316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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] [L766] 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=0, __unbuffered_p2_EAX=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] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1317, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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) [L788] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 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 [L788] 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)) [L789] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 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)) [L790] 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)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L793] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 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)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 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) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 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 [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 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 [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] 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=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, 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] [L832] 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) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 116.6s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 39.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5971 SDtfs, 6391 SDslu, 24583 SDs, 0 SdLazy, 21322 SolverSat, 311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 36 SyntacticMatches, 12 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 45.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 184830 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1103 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1013 ConstructedInterpolants, 0 QuantifiedInterpolants, 229646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...