/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:27:49,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:27:49,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:27:49,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:27:49,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:27:49,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:27:49,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:27:49,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:27:49,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:27:49,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:27:49,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:27:49,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:27:49,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:27:49,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:27:49,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:27:49,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:27:49,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:27:49,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:27:49,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:27:49,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:27:49,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:27:49,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:27:49,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:27:49,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:27:49,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:27:49,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:27:49,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:27:49,659 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:27:49,659 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:27:49,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:27:49,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:27:49,661 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:27:49,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:27:49,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:27:49,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:27:49,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:27:49,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:27:49,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:27:49,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:27:49,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:27:49,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:27:49,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:27:49,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:27:49,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:27:49,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:27:49,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:27:49,694 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:27:49,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:27:49,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:27:49,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:27:49,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:27:49,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:27:49,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:27:49,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:27:49,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:27:49,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:27:49,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:27:49,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:27:49,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:27:49,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:27:49,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:27:49,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:27:49,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:27:49,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:27:49,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:27:49,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:27:49,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:27:49,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:27:49,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:27:49,700 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:27:49,701 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:27:49,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:27:49,702 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:27:49,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:27:49,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:27:50,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:27:50,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:27:50,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:27:50,011 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:27:50,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix049_tso.opt.i [2019-12-27 21:27:50,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3bb0105/455859a263e146e3a0b2e43aef56b93f/FLAG8c56a11db [2019-12-27 21:27:50,672 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:27:50,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix049_tso.opt.i [2019-12-27 21:27:50,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3bb0105/455859a263e146e3a0b2e43aef56b93f/FLAG8c56a11db [2019-12-27 21:27:50,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc3bb0105/455859a263e146e3a0b2e43aef56b93f [2019-12-27 21:27:50,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:27:50,915 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:27:50,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:27:50,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:27:50,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:27:50,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:27:50" (1/1) ... [2019-12-27 21:27:50,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c54fe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:50, skipping insertion in model container [2019-12-27 21:27:50,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:27:50" (1/1) ... [2019-12-27 21:27:50,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:27:50,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:27:51,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:27:51,544 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:27:51,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:27:51,683 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:27:51,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51 WrapperNode [2019-12-27 21:27:51,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:27:51,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:27:51,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:27:51,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:27:51,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:27:51,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:27:51,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:27:51,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:27:51,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... [2019-12-27 21:27:51,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:27:51,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:27:51,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:27:51,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:27:51,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:27:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:27:51,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:27:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:27:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:27:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:27:51,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:27:51,863 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:27:51,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:27:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:27:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:27:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:27:51,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:27:51,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:27:51,866 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:27:52,638 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:27:52,638 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:27:52,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:27:52 BoogieIcfgContainer [2019-12-27 21:27:52,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:27:52,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:27:52,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:27:52,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:27:52,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:27:50" (1/3) ... [2019-12-27 21:27:52,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d53b7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:27:52, skipping insertion in model container [2019-12-27 21:27:52,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:27:51" (2/3) ... [2019-12-27 21:27:52,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d53b7bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:27:52, skipping insertion in model container [2019-12-27 21:27:52,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:27:52" (3/3) ... [2019-12-27 21:27:52,647 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_tso.opt.i [2019-12-27 21:27:52,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:27:52,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:27:52,664 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:27:52,665 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:27:52,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,706 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,706 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,716 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,741 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,742 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,769 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,771 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,779 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,780 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:27:52,804 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:27:52,824 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:27:52,824 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:27:52,824 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:27:52,824 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:27:52,824 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:27:52,824 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:27:52,825 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:27:52,825 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:27:52,841 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 21:27:52,843 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:27:52,954 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:27:52,955 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:27:52,970 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-27 21:27:52,992 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:27:53,047 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:27:53,047 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:27:53,055 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-27 21:27:53,076 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:27:53,077 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:27:55,555 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-12-27 21:27:56,472 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 21:27:56,603 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:27:56,642 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 21:27:56,642 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 21:27:56,646 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 21:28:19,796 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 21:28:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 21:28:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:28:19,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:19,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:28:19,805 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:28:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:19,811 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 21:28:19,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:19,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318597859] [2019-12-27 21:28:19,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:28:20,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318597859] [2019-12-27 21:28:20,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:20,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:28:20,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480144806] [2019-12-27 21:28:20,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:20,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:20,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:28:20,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:20,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:28:20,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:28:20,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:20,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:28:20,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:28:20,074 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 21:28:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:23,255 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 21:28:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:28:23,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:28:23,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:23,925 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 21:28:23,925 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 21:28:23,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:28:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 21:28:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 21:28:34,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 21:28:35,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 21:28:35,132 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 21:28:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:35,133 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 21:28:35,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:28:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 21:28:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:28:35,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:35,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:35,138 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:28:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 21:28:35,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:35,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398836201] [2019-12-27 21:28:35,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:28:35,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398836201] [2019-12-27 21:28:35,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:35,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:28:35,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1100804261] [2019-12-27 21:28:35,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:35,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:35,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:28:35,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:35,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:28:35,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:28:35,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:28:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:28:35,291 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 21:28:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:41,188 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 21:28:41,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:28:41,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:28:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:42,030 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 21:28:42,030 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 21:28:42,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:28:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 21:28:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 21:28:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 21:28:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 21:28:53,235 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 21:28:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:53,236 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 21:28:53,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:28:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 21:28:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:28:53,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:53,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:53,242 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:28:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:53,242 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 21:28:53,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:53,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551394470] [2019-12-27 21:28:53,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:28:53,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551394470] [2019-12-27 21:28:53,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:53,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:28:53,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991891234] [2019-12-27 21:28:53,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:53,309 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:53,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:28:53,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:53,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:28:53,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:28:53,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:28:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:28:53,313 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 21:28:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:28:53,501 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 21:28:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:28:53,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:28:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:28:53,565 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 21:28:53,566 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 21:28:53,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:28:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 21:28:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 21:28:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 21:28:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 21:28:59,745 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 21:28:59,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:28:59,746 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 21:28:59,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:28:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 21:28:59,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:28:59,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:28:59,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:28:59,749 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:28:59,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:28:59,749 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 21:28:59,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:28:59,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260928341] [2019-12-27 21:28:59,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:28:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:28:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:28:59,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260928341] [2019-12-27 21:28:59,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:28:59,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:28:59,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720030773] [2019-12-27 21:28:59,856 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:28:59,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:28:59,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:28:59,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:28:59,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:28:59,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:28:59,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:28:59,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:28:59,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:28:59,863 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 21:29:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:00,096 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 21:29:00,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:29:00,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:29:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:00,184 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 21:29:00,185 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 21:29:00,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:29:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 21:29:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 21:29:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 21:29:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 21:29:00,973 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 21:29:00,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:00,974 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 21:29:00,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:29:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 21:29:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:29:00,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:00,978 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:00,978 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:00,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:00,979 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 21:29:00,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:00,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313385876] [2019-12-27 21:29:00,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:01,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313385876] [2019-12-27 21:29:01,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:01,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:29:01,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098912900] [2019-12-27 21:29:01,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:01,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:01,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:29:01,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:01,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:29:01,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:29:01,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:29:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:29:01,078 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 21:29:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:01,927 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 21:29:01,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:29:01,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:29:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:02,012 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 21:29:02,013 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 21:29:02,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:29:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 21:29:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 21:29:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 21:29:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 21:29:02,914 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 21:29:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:02,914 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 21:29:02,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:29:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 21:29:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:29:02,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:02,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:02,928 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:02,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 21:29:02,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:02,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672076103] [2019-12-27 21:29:02,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:03,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672076103] [2019-12-27 21:29:03,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:03,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:29:03,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267719657] [2019-12-27 21:29:03,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:03,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:03,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 21:29:03,030 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:03,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:29:03,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:29:03,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:29:03,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:29:03,074 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 7 states. [2019-12-27 21:29:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:04,179 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 21:29:04,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:29:04,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 21:29:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:04,288 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 21:29:04,288 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 21:29:04,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:29:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 21:29:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 21:29:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 21:29:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 21:29:05,586 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 21:29:05,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:05,586 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 21:29:05,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:29:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 21:29:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:29:05,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:05,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:05,605 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:05,605 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 21:29:05,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:05,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061532419] [2019-12-27 21:29:05,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:05,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061532419] [2019-12-27 21:29:05,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:05,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:29:05,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1531807289] [2019-12-27 21:29:05,673 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:05,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:05,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:29:05,687 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:05,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:29:05,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:29:05,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:29:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:29:05,708 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 5 states. [2019-12-27 21:29:05,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:05,822 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 21:29:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:29:05,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:29:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:05,854 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 21:29:05,854 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 21:29:05,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:29:05,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 21:29:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 21:29:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 21:29:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 21:29:06,165 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 21:29:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:06,166 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 21:29:06,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:29:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 21:29:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:29:06,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:06,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:06,180 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:06,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 21:29:06,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:06,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314227724] [2019-12-27 21:29:06,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:06,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-27 21:29:06,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314227724] [2019-12-27 21:29:06,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:06,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:29:06,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1027944273] [2019-12-27 21:29:06,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:06,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:06,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:29:06,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:06,288 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:29:06,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:29:06,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:29:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:29:06,289 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 21:29:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:07,041 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 21:29:07,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:29:07,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:29:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:07,079 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 21:29:07,080 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 21:29:07,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:29:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 21:29:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 21:29:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 21:29:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 21:29:07,470 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 21:29:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:07,470 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 21:29:07,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:29:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 21:29:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:29:07,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:07,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:07,496 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 21:29:07,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:07,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752374791] [2019-12-27 21:29:07,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:07,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752374791] [2019-12-27 21:29:07,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:07,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:29:07,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2045229131] [2019-12-27 21:29:07,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:07,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:07,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 21:29:07,600 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:07,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:29:07,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:29:07,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:29:07,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:29:07,624 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 8 states. [2019-12-27 21:29:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:08,742 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 21:29:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:29:08,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:29:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:08,783 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 21:29:08,783 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 21:29:08,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:29:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 21:29:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 21:29:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 21:29:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 21:29:09,158 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 21:29:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:09,158 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 21:29:09,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:29:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 21:29:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:29:09,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:09,186 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:09,186 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:09,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:09,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 21:29:09,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:09,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426538358] [2019-12-27 21:29:09,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:09,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426538358] [2019-12-27 21:29:09,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:09,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:29:09,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [877213059] [2019-12-27 21:29:09,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:09,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:09,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 21:29:09,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:09,377 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:29:09,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:29:09,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:09,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:29:09,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:29:09,378 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 8 states. [2019-12-27 21:29:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:10,676 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 21:29:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:29:10,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 21:29:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:10,719 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 21:29:10,719 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 21:29:10,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:29:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 21:29:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 21:29:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 21:29:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 21:29:11,172 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 21:29:11,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:11,173 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 21:29:11,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:29:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 21:29:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:29:11,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:11,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:11,205 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:11,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:11,205 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 21:29:11,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:11,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299231797] [2019-12-27 21:29:11,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:11,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299231797] [2019-12-27 21:29:11,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:11,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:29:11,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1654866665] [2019-12-27 21:29:11,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:11,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:11,371 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 331 transitions. [2019-12-27 21:29:11,372 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:11,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:29:11,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:29:11,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:29:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:29:11,374 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 3 states. [2019-12-27 21:29:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:11,464 INFO L93 Difference]: Finished difference Result 26386 states and 81161 transitions. [2019-12-27 21:29:11,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:29:11,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 21:29:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:11,500 INFO L225 Difference]: With dead ends: 26386 [2019-12-27 21:29:11,500 INFO L226 Difference]: Without dead ends: 26386 [2019-12-27 21:29:11,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:29:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26386 states. [2019-12-27 21:29:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26386 to 22631. [2019-12-27 21:29:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22631 states. [2019-12-27 21:29:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22631 states to 22631 states and 70743 transitions. [2019-12-27 21:29:11,883 INFO L78 Accepts]: Start accepts. Automaton has 22631 states and 70743 transitions. Word has length 39 [2019-12-27 21:29:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:11,883 INFO L462 AbstractCegarLoop]: Abstraction has 22631 states and 70743 transitions. [2019-12-27 21:29:11,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:29:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 22631 states and 70743 transitions. [2019-12-27 21:29:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:29:11,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:11,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:11,906 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1172451276, now seen corresponding path program 1 times [2019-12-27 21:29:11,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:11,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394711701] [2019-12-27 21:29:11,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:11,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394711701] [2019-12-27 21:29:11,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:11,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:29:11,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [714973982] [2019-12-27 21:29:11,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:11,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:12,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 329 transitions. [2019-12-27 21:29:12,041 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:12,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:29:12,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:29:12,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:29:12,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:29:12,082 INFO L87 Difference]: Start difference. First operand 22631 states and 70743 transitions. Second operand 7 states. [2019-12-27 21:29:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:12,225 INFO L93 Difference]: Finished difference Result 21311 states and 67738 transitions. [2019-12-27 21:29:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:29:12,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:29:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:12,275 INFO L225 Difference]: With dead ends: 21311 [2019-12-27 21:29:12,275 INFO L226 Difference]: Without dead ends: 21311 [2019-12-27 21:29:12,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:29:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21311 states. [2019-12-27 21:29:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21311 to 21311. [2019-12-27 21:29:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21311 states. [2019-12-27 21:29:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21311 states to 21311 states and 67738 transitions. [2019-12-27 21:29:12,891 INFO L78 Accepts]: Start accepts. Automaton has 21311 states and 67738 transitions. Word has length 40 [2019-12-27 21:29:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:12,892 INFO L462 AbstractCegarLoop]: Abstraction has 21311 states and 67738 transitions. [2019-12-27 21:29:12,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:29:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 21311 states and 67738 transitions. [2019-12-27 21:29:12,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:29:12,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:12,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:12,922 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 236633210, now seen corresponding path program 1 times [2019-12-27 21:29:12,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:12,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567662911] [2019-12-27 21:29:12,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:13,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567662911] [2019-12-27 21:29:13,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:13,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:29:13,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [776129693] [2019-12-27 21:29:13,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:13,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:13,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 322 transitions. [2019-12-27 21:29:13,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:13,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:29:13,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:29:13,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:29:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:29:13,312 INFO L87 Difference]: Start difference. First operand 21311 states and 67738 transitions. Second operand 8 states. [2019-12-27 21:29:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:14,196 INFO L93 Difference]: Finished difference Result 72190 states and 228328 transitions. [2019-12-27 21:29:14,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:29:14,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:29:14,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:14,286 INFO L225 Difference]: With dead ends: 72190 [2019-12-27 21:29:14,287 INFO L226 Difference]: Without dead ends: 59049 [2019-12-27 21:29:14,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:29:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59049 states. [2019-12-27 21:29:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59049 to 24967. [2019-12-27 21:29:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24967 states. [2019-12-27 21:29:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24967 states to 24967 states and 79925 transitions. [2019-12-27 21:29:15,217 INFO L78 Accepts]: Start accepts. Automaton has 24967 states and 79925 transitions. Word has length 65 [2019-12-27 21:29:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:15,217 INFO L462 AbstractCegarLoop]: Abstraction has 24967 states and 79925 transitions. [2019-12-27 21:29:15,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:29:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 24967 states and 79925 transitions. [2019-12-27 21:29:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:29:15,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:15,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:15,254 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:15,255 INFO L82 PathProgramCache]: Analyzing trace with hash 896785052, now seen corresponding path program 2 times [2019-12-27 21:29:15,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:15,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527276784] [2019-12-27 21:29:15,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:15,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527276784] [2019-12-27 21:29:15,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:15,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:29:15,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372628901] [2019-12-27 21:29:15,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:15,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:15,500 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 276 transitions. [2019-12-27 21:29:15,500 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:15,549 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:29:15,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:29:15,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:29:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:29:15,550 INFO L87 Difference]: Start difference. First operand 24967 states and 79925 transitions. Second operand 10 states. [2019-12-27 21:29:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:17,683 INFO L93 Difference]: Finished difference Result 76936 states and 243966 transitions. [2019-12-27 21:29:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:29:17,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:29:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:17,774 INFO L225 Difference]: With dead ends: 76936 [2019-12-27 21:29:17,774 INFO L226 Difference]: Without dead ends: 57435 [2019-12-27 21:29:17,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:29:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57435 states. [2019-12-27 21:29:18,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57435 to 29639. [2019-12-27 21:29:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29639 states. [2019-12-27 21:29:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29639 states to 29639 states and 94665 transitions. [2019-12-27 21:29:18,859 INFO L78 Accepts]: Start accepts. Automaton has 29639 states and 94665 transitions. Word has length 65 [2019-12-27 21:29:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:18,859 INFO L462 AbstractCegarLoop]: Abstraction has 29639 states and 94665 transitions. [2019-12-27 21:29:18,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:29:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 29639 states and 94665 transitions. [2019-12-27 21:29:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:29:18,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:18,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:18,893 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:18,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1620990666, now seen corresponding path program 3 times [2019-12-27 21:29:18,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:18,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579750694] [2019-12-27 21:29:18,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:18,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579750694] [2019-12-27 21:29:18,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:18,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:29:18,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [228960825] [2019-12-27 21:29:18,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:19,014 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:19,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 362 transitions. [2019-12-27 21:29:19,211 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:19,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:29:19,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:29:19,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:19,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:29:19,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:29:19,249 INFO L87 Difference]: Start difference. First operand 29639 states and 94665 transitions. Second operand 8 states. [2019-12-27 21:29:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:20,949 INFO L93 Difference]: Finished difference Result 79319 states and 248856 transitions. [2019-12-27 21:29:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:29:20,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:29:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:21,057 INFO L225 Difference]: With dead ends: 79319 [2019-12-27 21:29:21,057 INFO L226 Difference]: Without dead ends: 70462 [2019-12-27 21:29:21,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:29:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70462 states. [2019-12-27 21:29:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70462 to 29947. [2019-12-27 21:29:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29947 states. [2019-12-27 21:29:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29947 states to 29947 states and 95616 transitions. [2019-12-27 21:29:22,202 INFO L78 Accepts]: Start accepts. Automaton has 29947 states and 95616 transitions. Word has length 65 [2019-12-27 21:29:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:22,202 INFO L462 AbstractCegarLoop]: Abstraction has 29947 states and 95616 transitions. [2019-12-27 21:29:22,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:29:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 29947 states and 95616 transitions. [2019-12-27 21:29:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:29:22,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:22,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:22,236 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:22,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:22,236 INFO L82 PathProgramCache]: Analyzing trace with hash 691532486, now seen corresponding path program 4 times [2019-12-27 21:29:22,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:22,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918339465] [2019-12-27 21:29:22,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:22,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918339465] [2019-12-27 21:29:22,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:22,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:29:22,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004190721] [2019-12-27 21:29:22,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:22,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:22,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 501 transitions. [2019-12-27 21:29:22,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:22,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:29:22,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:29:22,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:22,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:29:22,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:29:22,547 INFO L87 Difference]: Start difference. First operand 29947 states and 95616 transitions. Second operand 3 states. [2019-12-27 21:29:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:22,710 INFO L93 Difference]: Finished difference Result 34953 states and 110763 transitions. [2019-12-27 21:29:22,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:29:22,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:29:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:22,759 INFO L225 Difference]: With dead ends: 34953 [2019-12-27 21:29:22,759 INFO L226 Difference]: Without dead ends: 34953 [2019-12-27 21:29:22,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:29:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34953 states. [2019-12-27 21:29:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34953 to 30783. [2019-12-27 21:29:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30783 states. [2019-12-27 21:29:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30783 states to 30783 states and 98542 transitions. [2019-12-27 21:29:23,295 INFO L78 Accepts]: Start accepts. Automaton has 30783 states and 98542 transitions. Word has length 65 [2019-12-27 21:29:23,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:23,295 INFO L462 AbstractCegarLoop]: Abstraction has 30783 states and 98542 transitions. [2019-12-27 21:29:23,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:29:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30783 states and 98542 transitions. [2019-12-27 21:29:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:29:23,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:23,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:23,330 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash 868435461, now seen corresponding path program 1 times [2019-12-27 21:29:23,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:23,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2153967] [2019-12-27 21:29:23,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:23,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2153967] [2019-12-27 21:29:23,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:23,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:29:23,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238441717] [2019-12-27 21:29:23,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:23,431 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:23,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 305 transitions. [2019-12-27 21:29:23,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:23,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:29:23,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:29:23,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:29:23,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:29:23,977 INFO L87 Difference]: Start difference. First operand 30783 states and 98542 transitions. Second operand 5 states. [2019-12-27 21:29:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:24,617 INFO L93 Difference]: Finished difference Result 53671 states and 170907 transitions. [2019-12-27 21:29:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:29:24,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 21:29:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:24,702 INFO L225 Difference]: With dead ends: 53671 [2019-12-27 21:29:24,702 INFO L226 Difference]: Without dead ends: 53671 [2019-12-27 21:29:24,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:29:24,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53671 states. [2019-12-27 21:29:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53671 to 34219. [2019-12-27 21:29:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34219 states. [2019-12-27 21:29:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34219 states to 34219 states and 110736 transitions. [2019-12-27 21:29:25,459 INFO L78 Accepts]: Start accepts. Automaton has 34219 states and 110736 transitions. Word has length 66 [2019-12-27 21:29:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:25,459 INFO L462 AbstractCegarLoop]: Abstraction has 34219 states and 110736 transitions. [2019-12-27 21:29:25,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:29:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34219 states and 110736 transitions. [2019-12-27 21:29:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:29:25,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:25,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:25,497 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash -909174781, now seen corresponding path program 2 times [2019-12-27 21:29:25,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:25,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579660340] [2019-12-27 21:29:25,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:25,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579660340] [2019-12-27 21:29:25,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:25,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:29:25,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1390287698] [2019-12-27 21:29:25,552 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:25,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:25,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 297 transitions. [2019-12-27 21:29:25,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:25,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:29:25,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:29:25,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:29:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:29:25,811 INFO L87 Difference]: Start difference. First operand 34219 states and 110736 transitions. Second operand 3 states. [2019-12-27 21:29:26,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:26,077 INFO L93 Difference]: Finished difference Result 47990 states and 153962 transitions. [2019-12-27 21:29:26,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:29:26,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:29:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:26,161 INFO L225 Difference]: With dead ends: 47990 [2019-12-27 21:29:26,161 INFO L226 Difference]: Without dead ends: 47990 [2019-12-27 21:29:26,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:29:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47990 states. [2019-12-27 21:29:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47990 to 34147. [2019-12-27 21:29:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34147 states. [2019-12-27 21:29:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 110505 transitions. [2019-12-27 21:29:27,054 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 110505 transitions. Word has length 66 [2019-12-27 21:29:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:27,054 INFO L462 AbstractCegarLoop]: Abstraction has 34147 states and 110505 transitions. [2019-12-27 21:29:27,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:29:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 110505 transitions. [2019-12-27 21:29:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:29:27,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:27,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:27,092 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash -909555473, now seen corresponding path program 3 times [2019-12-27 21:29:27,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:27,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735317398] [2019-12-27 21:29:27,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:27,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735317398] [2019-12-27 21:29:27,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:27,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:29:27,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866565217] [2019-12-27 21:29:27,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:27,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:27,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 280 transitions. [2019-12-27 21:29:27,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:27,374 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:29:27,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:29:27,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:27,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:29:27,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:29:27,375 INFO L87 Difference]: Start difference. First operand 34147 states and 110505 transitions. Second operand 7 states. [2019-12-27 21:29:27,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:27,902 INFO L93 Difference]: Finished difference Result 70843 states and 225594 transitions. [2019-12-27 21:29:27,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:29:27,903 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 21:29:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:28,006 INFO L225 Difference]: With dead ends: 70843 [2019-12-27 21:29:28,006 INFO L226 Difference]: Without dead ends: 65288 [2019-12-27 21:29:28,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:29:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65288 states. [2019-12-27 21:29:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65288 to 34211. [2019-12-27 21:29:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34211 states. [2019-12-27 21:29:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34211 states to 34211 states and 110723 transitions. [2019-12-27 21:29:29,208 INFO L78 Accepts]: Start accepts. Automaton has 34211 states and 110723 transitions. Word has length 66 [2019-12-27 21:29:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:29,208 INFO L462 AbstractCegarLoop]: Abstraction has 34211 states and 110723 transitions. [2019-12-27 21:29:29,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:29:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34211 states and 110723 transitions. [2019-12-27 21:29:29,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:29:29,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:29,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:29,247 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash 862222067, now seen corresponding path program 4 times [2019-12-27 21:29:29,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:29,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494995397] [2019-12-27 21:29:29,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:29,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494995397] [2019-12-27 21:29:29,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:29,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:29:29,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1684376305] [2019-12-27 21:29:29,346 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:29,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:29,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 388 transitions. [2019-12-27 21:29:29,597 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:29,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:29:29,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:29:29,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:29,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:29:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:29:29,618 INFO L87 Difference]: Start difference. First operand 34211 states and 110723 transitions. Second operand 7 states. [2019-12-27 21:29:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:30,800 INFO L93 Difference]: Finished difference Result 68058 states and 217802 transitions. [2019-12-27 21:29:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 21:29:30,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 21:29:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:30,906 INFO L225 Difference]: With dead ends: 68058 [2019-12-27 21:29:30,906 INFO L226 Difference]: Without dead ends: 68058 [2019-12-27 21:29:30,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:29:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68058 states. [2019-12-27 21:29:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68058 to 35149. [2019-12-27 21:29:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35149 states. [2019-12-27 21:29:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35149 states to 35149 states and 113605 transitions. [2019-12-27 21:29:31,777 INFO L78 Accepts]: Start accepts. Automaton has 35149 states and 113605 transitions. Word has length 66 [2019-12-27 21:29:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:31,777 INFO L462 AbstractCegarLoop]: Abstraction has 35149 states and 113605 transitions. [2019-12-27 21:29:31,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:29:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 35149 states and 113605 transitions. [2019-12-27 21:29:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:29:31,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:31,816 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:31,816 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash 605319499, now seen corresponding path program 5 times [2019-12-27 21:29:31,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:31,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866740815] [2019-12-27 21:29:31,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:32,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866740815] [2019-12-27 21:29:32,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:32,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:29:32,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285735904] [2019-12-27 21:29:32,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:32,081 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:32,316 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 415 transitions. [2019-12-27 21:29:32,316 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:32,317 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:29:32,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:29:32,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:32,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:29:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:29:32,318 INFO L87 Difference]: Start difference. First operand 35149 states and 113605 transitions. Second operand 4 states. [2019-12-27 21:29:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:32,525 INFO L93 Difference]: Finished difference Result 41357 states and 133048 transitions. [2019-12-27 21:29:32,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:29:32,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:29:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:32,585 INFO L225 Difference]: With dead ends: 41357 [2019-12-27 21:29:32,585 INFO L226 Difference]: Without dead ends: 41357 [2019-12-27 21:29:32,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:29:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41357 states. [2019-12-27 21:29:33,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41357 to 31976. [2019-12-27 21:29:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 21:29:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 21:29:33,194 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 66 [2019-12-27 21:29:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:33,194 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 21:29:33,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:29:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 21:29:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:29:33,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:33,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:33,231 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 21:29:33,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:33,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297507381] [2019-12-27 21:29:33,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:33,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297507381] [2019-12-27 21:29:33,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:33,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:29:33,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446006133] [2019-12-27 21:29:33,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:33,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:33,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 502 transitions. [2019-12-27 21:29:33,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:33,532 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:29:33,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:29:33,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:29:33,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:29:33,533 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 4 states. [2019-12-27 21:29:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:33,821 INFO L93 Difference]: Finished difference Result 34683 states and 108446 transitions. [2019-12-27 21:29:33,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:29:33,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:29:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:33,870 INFO L225 Difference]: With dead ends: 34683 [2019-12-27 21:29:33,870 INFO L226 Difference]: Without dead ends: 34683 [2019-12-27 21:29:33,870 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-27 21:29:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34683 states. [2019-12-27 21:29:34,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34683 to 24273. [2019-12-27 21:29:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 21:29:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 21:29:34,489 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 21:29:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:34,489 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 21:29:34,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:29:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 21:29:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:29:34,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:34,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:34,514 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 21:29:34,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:34,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691872739] [2019-12-27 21:29:34,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:34,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691872739] [2019-12-27 21:29:34,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:34,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:29:34,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [653675198] [2019-12-27 21:29:34,679 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:34,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:34,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 322 transitions. [2019-12-27 21:29:34,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:34,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:29:34,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:29:34,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:29:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:29:34,947 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 12 states. [2019-12-27 21:29:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:36,608 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 21:29:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:29:36,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 21:29:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:36,650 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 21:29:36,651 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 21:29:36,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:29:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 21:29:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 21:29:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 21:29:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 21:29:37,067 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 21:29:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:37,067 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 21:29:37,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:29:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 21:29:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:29:37,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:37,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:37,095 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 21:29:37,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:37,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320292692] [2019-12-27 21:29:37,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:37,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320292692] [2019-12-27 21:29:37,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:37,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:29:37,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [649362404] [2019-12-27 21:29:37,292 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:37,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:37,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 341 transitions. [2019-12-27 21:29:37,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:37,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:29:37,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:29:37,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:37,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:29:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:29:37,831 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 13 states. [2019-12-27 21:29:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:39,756 INFO L93 Difference]: Finished difference Result 45644 states and 141958 transitions. [2019-12-27 21:29:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:29:39,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 21:29:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:39,815 INFO L225 Difference]: With dead ends: 45644 [2019-12-27 21:29:39,815 INFO L226 Difference]: Without dead ends: 40426 [2019-12-27 21:29:39,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:29:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40426 states. [2019-12-27 21:29:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40426 to 25169. [2019-12-27 21:29:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 21:29:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 21:29:40,364 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 21:29:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:40,364 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 21:29:40,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:29:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 21:29:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:29:40,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:40,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:40,394 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 21:29:40,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:40,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031153034] [2019-12-27 21:29:40,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:40,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031153034] [2019-12-27 21:29:40,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:40,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:29:40,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [730586421] [2019-12-27 21:29:40,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:40,593 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:40,994 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 617 transitions. [2019-12-27 21:29:40,994 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:41,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:29:41,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:29:41,649 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-27 21:29:41,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 21:29:42,107 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:29:42,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:29:42,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:29:42,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:29:42,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:29:42,109 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 19 states. [2019-12-27 21:29:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:46,416 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 21:29:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:29:46,417 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 21:29:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:46,463 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 21:29:46,463 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 21:29:46,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:29:46,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 21:29:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 21:29:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 21:29:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 21:29:46,917 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 21:29:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:46,917 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 21:29:46,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:29:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 21:29:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:29:46,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:46,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:46,946 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 21:29:46,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:46,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009660183] [2019-12-27 21:29:46,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:47,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009660183] [2019-12-27 21:29:47,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:47,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:29:47,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357440998] [2019-12-27 21:29:47,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:47,135 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:47,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 324 transitions. [2019-12-27 21:29:47,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:47,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:29:47,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:29:47,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:29:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:29:47,520 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 15 states. [2019-12-27 21:29:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:29:49,694 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-27 21:29:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 21:29:49,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 21:29:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:29:49,765 INFO L225 Difference]: With dead ends: 50603 [2019-12-27 21:29:49,765 INFO L226 Difference]: Without dead ends: 48055 [2019-12-27 21:29:49,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:29:49,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-27 21:29:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-27 21:29:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-27 21:29:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-27 21:29:50,699 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-27 21:29:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:29:50,700 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-27 21:29:50,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:29:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-27 21:29:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:29:50,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:29:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:29:50,734 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:29:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:29:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-27 21:29:50,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:29:50,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728117681] [2019-12-27 21:29:50,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:29:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:29:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:29:51,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728117681] [2019-12-27 21:29:51,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:29:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 21:29:51,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038308779] [2019-12-27 21:29:51,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:29:51,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:29:51,770 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 677 transitions. [2019-12-27 21:29:51,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:29:52,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:29:52,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 21:29:52,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 21:29:52,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:29:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 21:29:52,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:29:52,625 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 30 states. [2019-12-27 21:30:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:30:07,617 INFO L93 Difference]: Finished difference Result 72523 states and 221832 transitions. [2019-12-27 21:30:07,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 21:30:07,618 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 21:30:07,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:30:07,720 INFO L225 Difference]: With dead ends: 72523 [2019-12-27 21:30:07,720 INFO L226 Difference]: Without dead ends: 68051 [2019-12-27 21:30:07,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 13 SyntacticMatches, 17 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3362 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1365, Invalid=9977, Unknown=0, NotChecked=0, Total=11342 [2019-12-27 21:30:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68051 states. [2019-12-27 21:30:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68051 to 29878. [2019-12-27 21:30:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29878 states. [2019-12-27 21:30:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29878 states to 29878 states and 93126 transitions. [2019-12-27 21:30:08,512 INFO L78 Accepts]: Start accepts. Automaton has 29878 states and 93126 transitions. Word has length 67 [2019-12-27 21:30:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:30:08,512 INFO L462 AbstractCegarLoop]: Abstraction has 29878 states and 93126 transitions. [2019-12-27 21:30:08,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 21:30:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 29878 states and 93126 transitions. [2019-12-27 21:30:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:30:08,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:30:08,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:30:08,546 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:30:08,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:30:08,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1883446901, now seen corresponding path program 6 times [2019-12-27 21:30:08,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:30:08,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098834279] [2019-12-27 21:30:08,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:30:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:30:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:30:09,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098834279] [2019-12-27 21:30:09,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:30:09,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:30:09,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1624387551] [2019-12-27 21:30:09,017 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:30:09,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:30:09,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 332 transitions. [2019-12-27 21:30:09,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:30:09,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 21:30:09,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 21:30:09,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:30:09,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 21:30:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:30:09,996 INFO L87 Difference]: Start difference. First operand 29878 states and 93126 transitions. Second operand 22 states. [2019-12-27 21:30:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:30:16,549 INFO L93 Difference]: Finished difference Result 56716 states and 175022 transitions. [2019-12-27 21:30:16,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 21:30:16,549 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 21:30:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:30:16,629 INFO L225 Difference]: With dead ends: 56716 [2019-12-27 21:30:16,629 INFO L226 Difference]: Without dead ends: 52785 [2019-12-27 21:30:16,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=506, Invalid=2686, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 21:30:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52785 states. [2019-12-27 21:30:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52785 to 28873. [2019-12-27 21:30:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2019-12-27 21:30:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 90211 transitions. [2019-12-27 21:30:17,310 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 90211 transitions. Word has length 67 [2019-12-27 21:30:17,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:30:17,311 INFO L462 AbstractCegarLoop]: Abstraction has 28873 states and 90211 transitions. [2019-12-27 21:30:17,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 21:30:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 90211 transitions. [2019-12-27 21:30:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:30:17,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:30:17,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:30:17,348 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:30:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:30:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 7 times [2019-12-27 21:30:17,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:30:17,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219877640] [2019-12-27 21:30:17,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:30:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:30:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:30:17,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219877640] [2019-12-27 21:30:17,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:30:17,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:30:17,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881381459] [2019-12-27 21:30:17,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:30:17,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:30:18,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 633 transitions. [2019-12-27 21:30:18,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:30:18,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 21:30:18,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:30:18,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:30:18,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:30:18,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:30:18,548 INFO L87 Difference]: Start difference. First operand 28873 states and 90211 transitions. Second operand 16 states. [2019-12-27 21:30:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:30:19,993 INFO L93 Difference]: Finished difference Result 48445 states and 151039 transitions. [2019-12-27 21:30:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:30:19,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 21:30:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:30:20,052 INFO L225 Difference]: With dead ends: 48445 [2019-12-27 21:30:20,052 INFO L226 Difference]: Without dead ends: 40333 [2019-12-27 21:30:20,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2019-12-27 21:30:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40333 states. [2019-12-27 21:30:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40333 to 23485. [2019-12-27 21:30:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23485 states. [2019-12-27 21:30:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23485 states to 23485 states and 73461 transitions. [2019-12-27 21:30:20,564 INFO L78 Accepts]: Start accepts. Automaton has 23485 states and 73461 transitions. Word has length 67 [2019-12-27 21:30:20,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:30:20,565 INFO L462 AbstractCegarLoop]: Abstraction has 23485 states and 73461 transitions. [2019-12-27 21:30:20,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:30:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23485 states and 73461 transitions. [2019-12-27 21:30:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:30:20,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:30:20,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:30:20,590 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:30:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:30:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 8 times [2019-12-27 21:30:20,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:30:20,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632457627] [2019-12-27 21:30:20,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:30:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:30:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:30:20,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:30:20,715 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:30:20,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1318~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1318~0.base_21|) |v_ULTIMATE.start_main_~#t1318~0.offset_16| 0))) (= v_~main$tmp_guard0~0_10 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1318~0.base_21|) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1318~0.base_21| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$w_buff1_used~0_72) (= |v_ULTIMATE.start_main_~#t1318~0.offset_16| 0) (= 0 v_~weak$$choice0~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1318~0.base_21|) 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1318~0.base_21| 1) |v_#valid_59|) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t1320~0.base=|v_ULTIMATE.start_main_~#t1320~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~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_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t1318~0.base=|v_ULTIMATE.start_main_~#t1318~0.base_21|, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1319~0.base=|v_ULTIMATE.start_main_~#t1319~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ULTIMATE.start_main_~#t1318~0.offset=|v_ULTIMATE.start_main_~#t1318~0.offset_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1320~0.offset=|v_ULTIMATE.start_main_~#t1320~0.offset_15|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1319~0.offset=|v_ULTIMATE.start_main_~#t1319~0.offset_13|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1320~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1318~0.base, ~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_~#t1319~0.base, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1318~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1320~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1319~0.offset, 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, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:30:20,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1319~0.base_11|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1319~0.base_11| 1) |v_#valid_38|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1319~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1319~0.base_11|) |v_ULTIMATE.start_main_~#t1319~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1319~0.base_11| 4) |v_#length_17|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1319~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1319~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1319~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1319~0.offset=|v_ULTIMATE.start_main_~#t1319~0.offset_9|, ULTIMATE.start_main_~#t1319~0.base=|v_ULTIMATE.start_main_~#t1319~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|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1319~0.offset, ULTIMATE.start_main_~#t1319~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:30:20,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} 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-27 21:30:20,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1612466721 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1612466721 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1612466721| ~z~0_In-1612466721)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1612466721| ~z$w_buff1~0_In-1612466721) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1612466721, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1612466721, ~z$w_buff1~0=~z$w_buff1~0_In-1612466721, ~z~0=~z~0_In-1612466721} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1612466721|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1612466721, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1612466721, ~z$w_buff1~0=~z$w_buff1~0_In-1612466721, ~z~0=~z~0_In-1612466721} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 21:30:20,723 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-27 21:30:20,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1320~0.base_13|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1320~0.base_13| 1) |v_#valid_36|) (= |v_ULTIMATE.start_main_~#t1320~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1320~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t1320~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1320~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1320~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1320~0.base_13|) |v_ULTIMATE.start_main_~#t1320~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1320~0.base=|v_ULTIMATE.start_main_~#t1320~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1320~0.offset=|v_ULTIMATE.start_main_~#t1320~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1320~0.base, #length, ULTIMATE.start_main_~#t1320~0.offset] because there is no mapped edge [2019-12-27 21:30:20,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-967980388 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-967980388 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-967980388 |P1Thread1of1ForFork2_#t~ite11_Out-967980388|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-967980388|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-967980388, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-967980388} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-967980388, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-967980388|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-967980388} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:30:20,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In212104499 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In212104499 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In212104499 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In212104499 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out212104499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In212104499 |P1Thread1of1ForFork2_#t~ite12_Out212104499|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In212104499, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In212104499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In212104499, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In212104499} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In212104499, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In212104499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In212104499, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out212104499|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In212104499} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:30:20,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2073024108 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2073024108 256)))) (or (and (= ~z$r_buff0_thd2~0_In-2073024108 |P1Thread1of1ForFork2_#t~ite13_Out-2073024108|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-2073024108|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2073024108, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2073024108} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2073024108, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-2073024108|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2073024108} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:30:20,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1114573364 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1114573364| |P2Thread1of1ForFork0_#t~ite26_Out-1114573364|) (= ~z$w_buff0_used~0_In-1114573364 |P2Thread1of1ForFork0_#t~ite26_Out-1114573364|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1114573364 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1114573364 256) 0) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In-1114573364 256) 0)) (= (mod ~z$w_buff0_used~0_In-1114573364 256) 0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out-1114573364| ~z$w_buff0_used~0_In-1114573364) (= |P2Thread1of1ForFork0_#t~ite26_In-1114573364| |P2Thread1of1ForFork0_#t~ite26_Out-1114573364|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1114573364|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1114573364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1114573364, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1114573364, ~weak$$choice2~0=~weak$$choice2~0_In-1114573364} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1114573364|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1114573364|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1114573364, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1114573364, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1114573364, ~weak$$choice2~0=~weak$$choice2~0_In-1114573364} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:30:20,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:30:20,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In269913421 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In269913421 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In269913421 |P0Thread1of1ForFork1_#t~ite5_Out269913421|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out269913421|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In269913421, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In269913421} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out269913421|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269913421, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In269913421} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:30:20,734 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_22 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_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:30:20,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1962076863 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out-1962076863| |P2Thread1of1ForFork0_#t~ite38_Out-1962076863|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1962076863 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-1962076863| ~z~0_In-1962076863) (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-1962076863| ~z$w_buff1~0_In-1962076863) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1962076863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1962076863, ~z$w_buff1~0=~z$w_buff1~0_In-1962076863, ~z~0=~z~0_In-1962076863} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1962076863|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1962076863|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1962076863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1962076863, ~z$w_buff1~0=~z$w_buff1~0_In-1962076863, ~z~0=~z~0_In-1962076863} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:30:20,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-204821147 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-204821147 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-204821147| ~z$w_buff0_used~0_In-204821147) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-204821147| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-204821147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-204821147} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-204821147, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-204821147|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-204821147} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:30:20,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In651327887 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In651327887 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In651327887 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In651327887 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out651327887| ~z$w_buff1_used~0_In651327887) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out651327887|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In651327887, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In651327887, ~z$w_buff1_used~0=~z$w_buff1_used~0_In651327887, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In651327887} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In651327887, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In651327887, ~z$w_buff1_used~0=~z$w_buff1_used~0_In651327887, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In651327887, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out651327887|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:30:20,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In412835003 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In412835003 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In412835003 |P2Thread1of1ForFork0_#t~ite42_Out412835003|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out412835003|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In412835003, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In412835003} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In412835003, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In412835003, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out412835003|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:30:20,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In51158859 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In51158859 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In51158859 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In51158859 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out51158859|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In51158859 |P2Thread1of1ForFork0_#t~ite43_Out51158859|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In51158859, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In51158859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In51158859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In51158859} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out51158859|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In51158859, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In51158859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In51158859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In51158859} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:30:20,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, 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-27 21:30:20,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In1138249556 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1138249556 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1138249556 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1138249556 256)))) (or (and (= ~z$w_buff1_used~0_In1138249556 |P0Thread1of1ForFork1_#t~ite6_Out1138249556|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1138249556|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1138249556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1138249556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1138249556} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1138249556|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1138249556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1138249556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1138249556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:30:20,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In594780166 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In594780166 256) 0))) (or (and (= 0 ~z$r_buff0_thd1~0_Out594780166) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In594780166 ~z$r_buff0_thd1~0_Out594780166)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In594780166, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In594780166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In594780166, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out594780166|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out594780166} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:30:20,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1417533365 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1417533365 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1417533365 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1417533365 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1417533365| 0)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1417533365| ~z$r_buff1_thd1~0_In-1417533365) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1417533365, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1417533365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1417533365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1417533365} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1417533365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1417533365, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1417533365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1417533365, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1417533365} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:30:20,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} 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-27 21:30:20,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1858413906 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1858413906 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1858413906 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1858413906 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1858413906| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite14_Out-1858413906| ~z$r_buff1_thd2~0_In-1858413906) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858413906, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1858413906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858413906, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1858413906} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858413906, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1858413906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858413906, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1858413906|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1858413906} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:30:20,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, 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-27 21:30:20,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:30:20,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-670621802 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out-670621802| |ULTIMATE.start_main_#t~ite48_Out-670621802|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-670621802 256)))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite47_Out-670621802| ~z~0_In-670621802)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-670621802| ~z$w_buff1~0_In-670621802) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-670621802, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-670621802, ~z$w_buff1~0=~z$w_buff1~0_In-670621802, ~z~0=~z~0_In-670621802} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-670621802, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-670621802|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-670621802, ~z$w_buff1~0=~z$w_buff1~0_In-670621802, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-670621802|, ~z~0=~z~0_In-670621802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:30:20,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1341225583 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1341225583 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1341225583 |ULTIMATE.start_main_#t~ite49_Out1341225583|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1341225583|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1341225583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1341225583} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1341225583, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1341225583, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1341225583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:30:20,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1640746897 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1640746897 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1640746897 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1640746897 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out1640746897| ~z$w_buff1_used~0_In1640746897)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1640746897| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1640746897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1640746897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1640746897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1640746897} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1640746897|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1640746897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1640746897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1640746897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1640746897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:30:20,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In2111753217 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2111753217 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out2111753217|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In2111753217 |ULTIMATE.start_main_#t~ite51_Out2111753217|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2111753217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2111753217} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2111753217, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2111753217|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2111753217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:30:20,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1017987220 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1017987220 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1017987220 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1017987220 256)))) (or (and (= ~z$r_buff1_thd0~0_In1017987220 |ULTIMATE.start_main_#t~ite52_Out1017987220|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite52_Out1017987220|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1017987220, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1017987220, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1017987220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1017987220} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1017987220|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1017987220, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1017987220, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1017987220, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1017987220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:30:20,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:30:20,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:30:20 BasicIcfg [2019-12-27 21:30:20,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:30:20,831 INFO L168 Benchmark]: Toolchain (without parser) took 149916.80 ms. Allocated memory was 145.8 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 102.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 21:30:20,832 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:30:20,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.79 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 156.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:30:20,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.16 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:30:20,838 INFO L168 Benchmark]: Boogie Preprocessor took 37.56 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:30:20,839 INFO L168 Benchmark]: RCFGBuilder took 837.43 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:30:20,839 INFO L168 Benchmark]: TraceAbstraction took 148189.31 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:30:20,844 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.79 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.3 MB in the beginning and 156.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.16 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.56 ms. Allocated memory is still 203.4 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.43 ms. Allocated memory is still 203.4 MB. Free memory was 151.9 MB in the beginning and 101.4 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148189.31 ms. Allocated memory was 203.4 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 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(&t1318, ((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(&t1319, ((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(&t1320, ((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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=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=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_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=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [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: 147.8s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 59.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7703 SDtfs, 14184 SDslu, 35984 SDs, 0 SdLazy, 31539 SolverSat, 806 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 112 SyntacticMatches, 70 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5007 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 47.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 424629 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1476 NumberOfCodeBlocks, 1476 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 317906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...