/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/mix003_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:41:02,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:41:02,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:41:02,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:41:02,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:41:02,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:41:02,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:41:02,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:41:02,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:41:02,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:41:02,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:41:02,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:41:02,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:41:02,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:41:02,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:41:02,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:41:02,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:41:02,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:41:02,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:41:02,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:41:02,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:41:02,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:41:02,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:41:02,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:41:02,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:41:02,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:41:02,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:41:02,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:41:02,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:41:02,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:41:02,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:41:02,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:41:02,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:41:02,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:41:02,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:41:02,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:41:02,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:41:02,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:41:02,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:41:02,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:41:02,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:41:02,769 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 19:41:02,795 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:41:02,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:41:02,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:41:02,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:41:02,797 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:41:02,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:41:02,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:41:02,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:41:02,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:41:02,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:41:02,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:41:02,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:41:02,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:41:02,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:41:02,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:41:02,799 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:41:02,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:41:02,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:41:02,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:41:02,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:41:02,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:41:02,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:41:02,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:41:02,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:41:02,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:41:02,801 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:41:02,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:41:02,801 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:41:02,801 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:41:02,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:41:02,802 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:41:02,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:41:03,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:41:03,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:41:03,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:41:03,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:41:03,103 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:41:03,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_pso.oepc.i [2019-12-27 19:41:03,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ab56665/78a33e14217b43eb89f578b18faa7690/FLAGc13f475c4 [2019-12-27 19:41:03,762 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:41:03,763 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_pso.oepc.i [2019-12-27 19:41:03,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ab56665/78a33e14217b43eb89f578b18faa7690/FLAGc13f475c4 [2019-12-27 19:41:03,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ab56665/78a33e14217b43eb89f578b18faa7690 [2019-12-27 19:41:03,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:41:04,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:41:04,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:41:04,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:41:04,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:41:04,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:41:03" (1/1) ... [2019-12-27 19:41:04,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04, skipping insertion in model container [2019-12-27 19:41:04,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:41:03" (1/1) ... [2019-12-27 19:41:04,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:41:04,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:41:04,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:41:04,653 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:41:04,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:41:04,823 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:41:04,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04 WrapperNode [2019-12-27 19:41:04,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:41:04,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:41:04,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:41:04,824 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:41:04,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,856 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:41:04,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:41:04,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:41:04,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:41:04,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (1/1) ... [2019-12-27 19:41:04,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:41:04,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:41:04,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:41:04,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:41:04,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (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 19:41:05,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:41:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:41:05,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:41:05,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:41:05,018 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:41:05,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:41:05,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:41:05,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:41:05,019 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:41:05,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:41:05,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:41:05,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:41:05,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:41:05,025 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 19:41:05,862 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:41:05,863 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:41:05,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:41:05 BoogieIcfgContainer [2019-12-27 19:41:05,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:41:05,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:41:05,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:41:05,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:41:05,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:41:03" (1/3) ... [2019-12-27 19:41:05,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600b3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:41:05, skipping insertion in model container [2019-12-27 19:41:05,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:41:04" (2/3) ... [2019-12-27 19:41:05,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600b3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:41:05, skipping insertion in model container [2019-12-27 19:41:05,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:41:05" (3/3) ... [2019-12-27 19:41:05,873 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_pso.oepc.i [2019-12-27 19:41:05,884 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:41:05,884 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:41:05,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:41:05,893 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:41:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,966 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:05,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,027 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,029 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,031 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,032 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,036 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,036 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,037 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:41:06,068 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:41:06,088 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:41:06,088 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:41:06,088 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:41:06,088 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:41:06,089 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:41:06,089 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:41:06,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:41:06,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:41:06,102 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 19:41:06,104 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:41:06,209 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:41:06,209 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:41:06,224 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:41:06,248 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 19:41:06,305 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 19:41:06,306 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:41:06,314 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 439 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:41:06,336 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:41:06,338 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:41:06,554 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 19:41:10,038 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 19:41:10,186 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 19:41:10,215 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85139 [2019-12-27 19:41:10,215 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 19:41:10,219 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-27 19:41:28,102 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115082 states. [2019-12-27 19:41:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 115082 states. [2019-12-27 19:41:28,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:41:28,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:28,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:41:28,110 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 19:41:28,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:28,115 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 19:41:28,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:28,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258716880] [2019-12-27 19:41:28,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:28,371 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 19:41:28,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258716880] [2019-12-27 19:41:28,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:28,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:41:28,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371897715] [2019-12-27 19:41:28,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:28,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:28,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:41:28,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:28,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:28,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:41:28,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:41:28,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:41:28,411 INFO L87 Difference]: Start difference. First operand 115082 states. Second operand 3 states. [2019-12-27 19:41:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:29,691 INFO L93 Difference]: Finished difference Result 114348 states and 491658 transitions. [2019-12-27 19:41:29,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:41:29,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:41:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:33,472 INFO L225 Difference]: With dead ends: 114348 [2019-12-27 19:41:33,472 INFO L226 Difference]: Without dead ends: 107250 [2019-12-27 19:41:33,480 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 19:41:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107250 states. [2019-12-27 19:41:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107250 to 107250. [2019-12-27 19:41:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107250 states. [2019-12-27 19:41:41,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107250 states to 107250 states and 460523 transitions. [2019-12-27 19:41:41,268 INFO L78 Accepts]: Start accepts. Automaton has 107250 states and 460523 transitions. Word has length 3 [2019-12-27 19:41:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:41:41,269 INFO L462 AbstractCegarLoop]: Abstraction has 107250 states and 460523 transitions. [2019-12-27 19:41:41,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:41:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 107250 states and 460523 transitions. [2019-12-27 19:41:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:41:41,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:41:41,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:41:41,274 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 19:41:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:41:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash -906390211, now seen corresponding path program 1 times [2019-12-27 19:41:41,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:41:41,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118795359] [2019-12-27 19:41:41,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:41:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:41:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:41:41,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118795359] [2019-12-27 19:41:41,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:41:41,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:41:41,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1246466564] [2019-12-27 19:41:41,392 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:41:41,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:41:41,398 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:41:41,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:41:41,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:41:41,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:41:41,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:41:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:41:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:41:41,401 INFO L87 Difference]: Start difference. First operand 107250 states and 460523 transitions. Second operand 4 states. [2019-12-27 19:41:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:41:46,051 INFO L93 Difference]: Finished difference Result 171260 states and 704759 transitions. [2019-12-27 19:41:46,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:41:46,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 19:41:46,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:41:46,666 INFO L225 Difference]: With dead ends: 171260 [2019-12-27 19:41:46,667 INFO L226 Difference]: Without dead ends: 171211 [2019-12-27 19:41:46,668 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 19:41:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171211 states. [2019-12-27 19:42:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171211 to 155734. [2019-12-27 19:42:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155734 states. [2019-12-27 19:42:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155734 states to 155734 states and 649769 transitions. [2019-12-27 19:42:00,899 INFO L78 Accepts]: Start accepts. Automaton has 155734 states and 649769 transitions. Word has length 11 [2019-12-27 19:42:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:00,900 INFO L462 AbstractCegarLoop]: Abstraction has 155734 states and 649769 transitions. [2019-12-27 19:42:00,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 155734 states and 649769 transitions. [2019-12-27 19:42:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:42:00,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:00,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:00,907 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 19:42:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1306732541, now seen corresponding path program 1 times [2019-12-27 19:42:00,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:00,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945910079] [2019-12-27 19:42:00,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:00,999 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 19:42:00,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945910079] [2019-12-27 19:42:00,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:00,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:01,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904293079] [2019-12-27 19:42:01,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:01,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:01,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:42:01,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:01,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:01,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:01,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:01,004 INFO L87 Difference]: Start difference. First operand 155734 states and 649769 transitions. Second operand 3 states. [2019-12-27 19:42:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:01,167 INFO L93 Difference]: Finished difference Result 34176 states and 112026 transitions. [2019-12-27 19:42:01,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:01,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:42:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:01,221 INFO L225 Difference]: With dead ends: 34176 [2019-12-27 19:42:01,221 INFO L226 Difference]: Without dead ends: 34176 [2019-12-27 19:42:01,221 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 19:42:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34176 states. [2019-12-27 19:42:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34176 to 34176. [2019-12-27 19:42:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34176 states. [2019-12-27 19:42:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34176 states to 34176 states and 112026 transitions. [2019-12-27 19:42:06,720 INFO L78 Accepts]: Start accepts. Automaton has 34176 states and 112026 transitions. Word has length 13 [2019-12-27 19:42:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:06,720 INFO L462 AbstractCegarLoop]: Abstraction has 34176 states and 112026 transitions. [2019-12-27 19:42:06,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 34176 states and 112026 transitions. [2019-12-27 19:42:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:42:06,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:06,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:06,723 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 19:42:06,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash 54051154, now seen corresponding path program 1 times [2019-12-27 19:42:06,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:06,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861285687] [2019-12-27 19:42:06,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:42:06,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861285687] [2019-12-27 19:42:06,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:06,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:06,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [871136122] [2019-12-27 19:42:06,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:06,807 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:06,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:42:06,810 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:06,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:06,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:42:06,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:42:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:42:06,814 INFO L87 Difference]: Start difference. First operand 34176 states and 112026 transitions. Second operand 4 states. [2019-12-27 19:42:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:07,160 INFO L93 Difference]: Finished difference Result 42178 states and 136956 transitions. [2019-12-27 19:42:07,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:07,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:42:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:07,227 INFO L225 Difference]: With dead ends: 42178 [2019-12-27 19:42:07,227 INFO L226 Difference]: Without dead ends: 42178 [2019-12-27 19:42:07,227 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 19:42:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42178 states. [2019-12-27 19:42:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42178 to 38132. [2019-12-27 19:42:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38132 states. [2019-12-27 19:42:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38132 states to 38132 states and 124449 transitions. [2019-12-27 19:42:07,937 INFO L78 Accepts]: Start accepts. Automaton has 38132 states and 124449 transitions. Word has length 16 [2019-12-27 19:42:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:07,939 INFO L462 AbstractCegarLoop]: Abstraction has 38132 states and 124449 transitions. [2019-12-27 19:42:07,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 38132 states and 124449 transitions. [2019-12-27 19:42:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:42:07,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:07,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:07,942 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 19:42:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash 53948296, now seen corresponding path program 1 times [2019-12-27 19:42:07,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:07,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487686761] [2019-12-27 19:42:07,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:08,002 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 19:42:08,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487686761] [2019-12-27 19:42:08,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:08,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:08,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [380946301] [2019-12-27 19:42:08,003 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:08,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:08,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:42:08,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:08,008 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:08,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:08,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:08,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:08,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:08,009 INFO L87 Difference]: Start difference. First operand 38132 states and 124449 transitions. Second operand 3 states. [2019-12-27 19:42:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:08,246 INFO L93 Difference]: Finished difference Result 55464 states and 180253 transitions. [2019-12-27 19:42:08,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:08,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 19:42:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:08,359 INFO L225 Difference]: With dead ends: 55464 [2019-12-27 19:42:08,359 INFO L226 Difference]: Without dead ends: 55464 [2019-12-27 19:42:08,359 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 19:42:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55464 states. [2019-12-27 19:42:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55464 to 42552. [2019-12-27 19:42:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42552 states. [2019-12-27 19:42:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42552 states to 42552 states and 139903 transitions. [2019-12-27 19:42:09,561 INFO L78 Accepts]: Start accepts. Automaton has 42552 states and 139903 transitions. Word has length 16 [2019-12-27 19:42:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:09,561 INFO L462 AbstractCegarLoop]: Abstraction has 42552 states and 139903 transitions. [2019-12-27 19:42:09,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 42552 states and 139903 transitions. [2019-12-27 19:42:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:42:09,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:09,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:09,564 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 19:42:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1761611220, now seen corresponding path program 1 times [2019-12-27 19:42:09,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:09,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660234230] [2019-12-27 19:42:09,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:09,631 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 19:42:09,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660234230] [2019-12-27 19:42:09,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:09,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:09,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746756479] [2019-12-27 19:42:09,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:09,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:09,638 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:42:09,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:09,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:09,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:42:09,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:42:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:42:09,640 INFO L87 Difference]: Start difference. First operand 42552 states and 139903 transitions. Second operand 4 states. [2019-12-27 19:42:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:10,034 INFO L93 Difference]: Finished difference Result 50497 states and 164640 transitions. [2019-12-27 19:42:10,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:10,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:42:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:10,121 INFO L225 Difference]: With dead ends: 50497 [2019-12-27 19:42:10,121 INFO L226 Difference]: Without dead ends: 50497 [2019-12-27 19:42:10,121 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 19:42:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50497 states. [2019-12-27 19:42:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50497 to 44016. [2019-12-27 19:42:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44016 states. [2019-12-27 19:42:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44016 states to 44016 states and 144770 transitions. [2019-12-27 19:42:11,363 INFO L78 Accepts]: Start accepts. Automaton has 44016 states and 144770 transitions. Word has length 16 [2019-12-27 19:42:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:11,364 INFO L462 AbstractCegarLoop]: Abstraction has 44016 states and 144770 transitions. [2019-12-27 19:42:11,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 44016 states and 144770 transitions. [2019-12-27 19:42:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:42:11,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:11,373 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 19:42:11,373 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 19:42:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1491539652, now seen corresponding path program 1 times [2019-12-27 19:42:11,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:11,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801051748] [2019-12-27 19:42:11,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:11,465 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 19:42:11,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801051748] [2019-12-27 19:42:11,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:11,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:11,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009333924] [2019-12-27 19:42:11,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:11,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:11,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:42:11,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:11,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:11,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:42:11,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:11,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:42:11,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:42:11,518 INFO L87 Difference]: Start difference. First operand 44016 states and 144770 transitions. Second operand 6 states. [2019-12-27 19:42:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:12,262 INFO L93 Difference]: Finished difference Result 60577 states and 194051 transitions. [2019-12-27 19:42:12,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:42:12,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:42:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:12,365 INFO L225 Difference]: With dead ends: 60577 [2019-12-27 19:42:12,365 INFO L226 Difference]: Without dead ends: 60570 [2019-12-27 19:42:12,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:42:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60570 states. [2019-12-27 19:42:13,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60570 to 45150. [2019-12-27 19:42:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45150 states. [2019-12-27 19:42:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45150 states to 45150 states and 148226 transitions. [2019-12-27 19:42:13,277 INFO L78 Accepts]: Start accepts. Automaton has 45150 states and 148226 transitions. Word has length 22 [2019-12-27 19:42:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:13,277 INFO L462 AbstractCegarLoop]: Abstraction has 45150 states and 148226 transitions. [2019-12-27 19:42:13,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:42:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45150 states and 148226 transitions. [2019-12-27 19:42:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:42:13,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:13,287 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 19:42:13,287 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 19:42:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 987765270, now seen corresponding path program 1 times [2019-12-27 19:42:13,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:13,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936587030] [2019-12-27 19:42:13,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:13,370 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 19:42:13,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936587030] [2019-12-27 19:42:13,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:13,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:13,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1034654093] [2019-12-27 19:42:13,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:13,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:13,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:42:13,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:13,399 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:13,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:42:13,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:42:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:42:13,400 INFO L87 Difference]: Start difference. First operand 45150 states and 148226 transitions. Second operand 6 states. [2019-12-27 19:42:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:14,620 INFO L93 Difference]: Finished difference Result 63824 states and 203774 transitions. [2019-12-27 19:42:14,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:42:14,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 19:42:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:14,731 INFO L225 Difference]: With dead ends: 63824 [2019-12-27 19:42:14,732 INFO L226 Difference]: Without dead ends: 63817 [2019-12-27 19:42:14,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 19:42:15,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63817 states. [2019-12-27 19:42:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63817 to 43599. [2019-12-27 19:42:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43599 states. [2019-12-27 19:42:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43599 states to 43599 states and 143212 transitions. [2019-12-27 19:42:15,668 INFO L78 Accepts]: Start accepts. Automaton has 43599 states and 143212 transitions. Word has length 22 [2019-12-27 19:42:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:15,668 INFO L462 AbstractCegarLoop]: Abstraction has 43599 states and 143212 transitions. [2019-12-27 19:42:15,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:42:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43599 states and 143212 transitions. [2019-12-27 19:42:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:42:15,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:15,680 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 19:42:15,680 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 19:42:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1953235153, now seen corresponding path program 1 times [2019-12-27 19:42:15,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:15,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326491927] [2019-12-27 19:42:15,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:15,742 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 19:42:15,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326491927] [2019-12-27 19:42:15,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:15,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:15,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527084545] [2019-12-27 19:42:15,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:15,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:15,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:42:15,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:15,778 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:42:15,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:42:15,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:15,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:42:15,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:42:15,779 INFO L87 Difference]: Start difference. First operand 43599 states and 143212 transitions. Second operand 5 states. [2019-12-27 19:42:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:15,876 INFO L93 Difference]: Finished difference Result 17791 states and 55309 transitions. [2019-12-27 19:42:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:42:15,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:42:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:15,902 INFO L225 Difference]: With dead ends: 17791 [2019-12-27 19:42:15,902 INFO L226 Difference]: Without dead ends: 17791 [2019-12-27 19:42:15,903 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 19:42:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17791 states. [2019-12-27 19:42:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17791 to 17428. [2019-12-27 19:42:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:42:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 54273 transitions. [2019-12-27 19:42:16,189 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 54273 transitions. Word has length 25 [2019-12-27 19:42:16,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:16,190 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 54273 transitions. [2019-12-27 19:42:16,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:42:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 54273 transitions. [2019-12-27 19:42:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:42:16,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:16,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:16,204 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 19:42:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash 451000002, now seen corresponding path program 1 times [2019-12-27 19:42:16,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:16,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698590444] [2019-12-27 19:42:16,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:16,242 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 19:42:16,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698590444] [2019-12-27 19:42:16,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:16,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:16,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1512207052] [2019-12-27 19:42:16,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:16,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:16,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:42:16,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:16,253 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:16,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:16,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:16,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:16,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:16,255 INFO L87 Difference]: Start difference. First operand 17428 states and 54273 transitions. Second operand 3 states. [2019-12-27 19:42:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:16,567 INFO L93 Difference]: Finished difference Result 22857 states and 67585 transitions. [2019-12-27 19:42:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:16,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 19:42:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:16,596 INFO L225 Difference]: With dead ends: 22857 [2019-12-27 19:42:16,596 INFO L226 Difference]: Without dead ends: 22857 [2019-12-27 19:42:16,596 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 19:42:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-12-27 19:42:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 17428. [2019-12-27 19:42:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17428 states. [2019-12-27 19:42:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17428 states to 17428 states and 51895 transitions. [2019-12-27 19:42:16,887 INFO L78 Accepts]: Start accepts. Automaton has 17428 states and 51895 transitions. Word has length 27 [2019-12-27 19:42:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:16,887 INFO L462 AbstractCegarLoop]: Abstraction has 17428 states and 51895 transitions. [2019-12-27 19:42:16,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 17428 states and 51895 transitions. [2019-12-27 19:42:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:42:16,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:16,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:16,899 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 19:42:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -319576223, now seen corresponding path program 1 times [2019-12-27 19:42:16,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:16,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233122606] [2019-12-27 19:42:16,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:16,963 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 19:42:16,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233122606] [2019-12-27 19:42:16,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:16,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:16,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1293435111] [2019-12-27 19:42:16,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:16,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:16,973 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:42:16,974 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:16,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:16,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:42:16,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:42:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:42:16,976 INFO L87 Difference]: Start difference. First operand 17428 states and 51895 transitions. Second operand 5 states. [2019-12-27 19:42:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:17,355 INFO L93 Difference]: Finished difference Result 21434 states and 63020 transitions. [2019-12-27 19:42:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:42:17,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 19:42:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:17,385 INFO L225 Difference]: With dead ends: 21434 [2019-12-27 19:42:17,385 INFO L226 Difference]: Without dead ends: 21434 [2019-12-27 19:42:17,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21434 states. [2019-12-27 19:42:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21434 to 20103. [2019-12-27 19:42:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20103 states. [2019-12-27 19:42:17,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20103 states to 20103 states and 59665 transitions. [2019-12-27 19:42:17,698 INFO L78 Accepts]: Start accepts. Automaton has 20103 states and 59665 transitions. Word has length 27 [2019-12-27 19:42:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:17,698 INFO L462 AbstractCegarLoop]: Abstraction has 20103 states and 59665 transitions. [2019-12-27 19:42:17,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:42:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 20103 states and 59665 transitions. [2019-12-27 19:42:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 19:42:17,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:17,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:17,713 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 19:42:17,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:17,713 INFO L82 PathProgramCache]: Analyzing trace with hash -19850815, now seen corresponding path program 1 times [2019-12-27 19:42:17,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:17,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629038729] [2019-12-27 19:42:17,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:17,799 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 19:42:17,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629038729] [2019-12-27 19:42:17,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:17,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:17,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1808369750] [2019-12-27 19:42:17,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:17,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:17,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 19:42:17,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:17,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:17,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:42:17,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:42:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:42:17,816 INFO L87 Difference]: Start difference. First operand 20103 states and 59665 transitions. Second operand 5 states. [2019-12-27 19:42:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:18,221 INFO L93 Difference]: Finished difference Result 23480 states and 68878 transitions. [2019-12-27 19:42:18,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:42:18,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 19:42:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:18,254 INFO L225 Difference]: With dead ends: 23480 [2019-12-27 19:42:18,254 INFO L226 Difference]: Without dead ends: 23480 [2019-12-27 19:42:18,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23480 states. [2019-12-27 19:42:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23480 to 20114. [2019-12-27 19:42:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20114 states. [2019-12-27 19:42:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20114 states to 20114 states and 59552 transitions. [2019-12-27 19:42:18,591 INFO L78 Accepts]: Start accepts. Automaton has 20114 states and 59552 transitions. Word has length 28 [2019-12-27 19:42:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:18,592 INFO L462 AbstractCegarLoop]: Abstraction has 20114 states and 59552 transitions. [2019-12-27 19:42:18,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:42:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 20114 states and 59552 transitions. [2019-12-27 19:42:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:42:18,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:18,615 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 19:42:18,615 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 19:42:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 900090167, now seen corresponding path program 1 times [2019-12-27 19:42:18,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:18,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605086300] [2019-12-27 19:42:18,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:42:18,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605086300] [2019-12-27 19:42:18,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:18,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:42:18,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451115762] [2019-12-27 19:42:18,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:18,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:18,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 19:42:18,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:18,749 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:18,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:42:18,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:42:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:18,751 INFO L87 Difference]: Start difference. First operand 20114 states and 59552 transitions. Second operand 7 states. [2019-12-27 19:42:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:19,566 INFO L93 Difference]: Finished difference Result 27182 states and 79348 transitions. [2019-12-27 19:42:19,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:42:19,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 19:42:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:19,616 INFO L225 Difference]: With dead ends: 27182 [2019-12-27 19:42:19,616 INFO L226 Difference]: Without dead ends: 27182 [2019-12-27 19:42:19,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:42:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27182 states. [2019-12-27 19:42:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27182 to 21362. [2019-12-27 19:42:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21362 states. [2019-12-27 19:42:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21362 states to 21362 states and 63339 transitions. [2019-12-27 19:42:20,260 INFO L78 Accepts]: Start accepts. Automaton has 21362 states and 63339 transitions. Word has length 33 [2019-12-27 19:42:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:20,261 INFO L462 AbstractCegarLoop]: Abstraction has 21362 states and 63339 transitions. [2019-12-27 19:42:20,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:42:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 21362 states and 63339 transitions. [2019-12-27 19:42:20,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:42:20,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:20,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:20,284 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 19:42:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash -864898389, now seen corresponding path program 1 times [2019-12-27 19:42:20,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:20,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402048655] [2019-12-27 19:42:20,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:20,383 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 19:42:20,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402048655] [2019-12-27 19:42:20,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:20,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:42:20,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566534980] [2019-12-27 19:42:20,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:20,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:20,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 19:42:20,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:20,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:42:20,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:42:20,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:42:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:20,428 INFO L87 Difference]: Start difference. First operand 21362 states and 63339 transitions. Second operand 7 states. [2019-12-27 19:42:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:21,233 INFO L93 Difference]: Finished difference Result 26308 states and 76942 transitions. [2019-12-27 19:42:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:42:21,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 19:42:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:21,270 INFO L225 Difference]: With dead ends: 26308 [2019-12-27 19:42:21,270 INFO L226 Difference]: Without dead ends: 26308 [2019-12-27 19:42:21,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:42:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26308 states. [2019-12-27 19:42:21,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26308 to 18242. [2019-12-27 19:42:21,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18242 states. [2019-12-27 19:42:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18242 states to 18242 states and 54251 transitions. [2019-12-27 19:42:21,605 INFO L78 Accepts]: Start accepts. Automaton has 18242 states and 54251 transitions. Word has length 34 [2019-12-27 19:42:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:21,605 INFO L462 AbstractCegarLoop]: Abstraction has 18242 states and 54251 transitions. [2019-12-27 19:42:21,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:42:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 18242 states and 54251 transitions. [2019-12-27 19:42:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:42:21,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:21,623 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 19:42:21,624 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 19:42:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash 173355914, now seen corresponding path program 1 times [2019-12-27 19:42:21,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:21,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197886599] [2019-12-27 19:42:21,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:21,691 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 19:42:21,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197886599] [2019-12-27 19:42:21,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:21,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:42:21,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745467901] [2019-12-27 19:42:21,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:21,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:21,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 231 transitions. [2019-12-27 19:42:21,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:21,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:42:21,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:21,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:21,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:21,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:21,762 INFO L87 Difference]: Start difference. First operand 18242 states and 54251 transitions. Second operand 3 states. [2019-12-27 19:42:21,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:21,839 INFO L93 Difference]: Finished difference Result 18241 states and 54249 transitions. [2019-12-27 19:42:21,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:21,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 19:42:21,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:21,872 INFO L225 Difference]: With dead ends: 18241 [2019-12-27 19:42:21,872 INFO L226 Difference]: Without dead ends: 18241 [2019-12-27 19:42:21,872 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 19:42:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18241 states. [2019-12-27 19:42:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18241 to 18241. [2019-12-27 19:42:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18241 states. [2019-12-27 19:42:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18241 states to 18241 states and 54249 transitions. [2019-12-27 19:42:22,354 INFO L78 Accepts]: Start accepts. Automaton has 18241 states and 54249 transitions. Word has length 39 [2019-12-27 19:42:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:22,354 INFO L462 AbstractCegarLoop]: Abstraction has 18241 states and 54249 transitions. [2019-12-27 19:42:22,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 18241 states and 54249 transitions. [2019-12-27 19:42:22,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:42:22,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:22,382 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 19:42:22,382 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 19:42:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash -121906311, now seen corresponding path program 1 times [2019-12-27 19:42:22,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:22,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233316106] [2019-12-27 19:42:22,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:22,438 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 19:42:22,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233316106] [2019-12-27 19:42:22,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:22,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:42:22,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2141498967] [2019-12-27 19:42:22,439 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:22,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:22,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 276 transitions. [2019-12-27 19:42:22,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:22,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:42:22,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:42:22,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:42:22,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:22,557 INFO L87 Difference]: Start difference. First operand 18241 states and 54249 transitions. Second operand 7 states. [2019-12-27 19:42:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:22,648 INFO L93 Difference]: Finished difference Result 17018 states and 51506 transitions. [2019-12-27 19:42:22,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:42:22,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 19:42:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:22,670 INFO L225 Difference]: With dead ends: 17018 [2019-12-27 19:42:22,671 INFO L226 Difference]: Without dead ends: 17018 [2019-12-27 19:42:22,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:42:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17018 states. [2019-12-27 19:42:22,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17018 to 16437. [2019-12-27 19:42:22,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16437 states. [2019-12-27 19:42:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16437 states to 16437 states and 49937 transitions. [2019-12-27 19:42:22,926 INFO L78 Accepts]: Start accepts. Automaton has 16437 states and 49937 transitions. Word has length 40 [2019-12-27 19:42:22,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:22,926 INFO L462 AbstractCegarLoop]: Abstraction has 16437 states and 49937 transitions. [2019-12-27 19:42:22,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:42:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16437 states and 49937 transitions. [2019-12-27 19:42:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:42:22,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:22,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] [2019-12-27 19:42:22,946 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 19:42:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash 238839884, now seen corresponding path program 1 times [2019-12-27 19:42:22,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:22,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102061705] [2019-12-27 19:42:22,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:23,038 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 19:42:23,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102061705] [2019-12-27 19:42:23,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:23,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:42:23,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [585126300] [2019-12-27 19:42:23,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:23,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:23,453 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 464 transitions. [2019-12-27 19:42:23,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:23,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:42:23,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:42:23,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:23,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:42:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:42:23,494 INFO L87 Difference]: Start difference. First operand 16437 states and 49937 transitions. Second operand 9 states. [2019-12-27 19:42:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:26,864 INFO L93 Difference]: Finished difference Result 76853 states and 228229 transitions. [2019-12-27 19:42:26,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 19:42:26,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 19:42:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:26,948 INFO L225 Difference]: With dead ends: 76853 [2019-12-27 19:42:26,948 INFO L226 Difference]: Without dead ends: 60139 [2019-12-27 19:42:26,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:42:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60139 states. [2019-12-27 19:42:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60139 to 20169. [2019-12-27 19:42:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20169 states. [2019-12-27 19:42:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 61518 transitions. [2019-12-27 19:42:27,577 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 61518 transitions. Word has length 64 [2019-12-27 19:42:27,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:27,577 INFO L462 AbstractCegarLoop]: Abstraction has 20169 states and 61518 transitions. [2019-12-27 19:42:27,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:42:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 61518 transitions. [2019-12-27 19:42:27,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:42:27,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:27,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:27,602 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 19:42:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash 688821650, now seen corresponding path program 2 times [2019-12-27 19:42:27,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:27,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623708094] [2019-12-27 19:42:27,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:42:27,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623708094] [2019-12-27 19:42:27,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:27,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:42:27,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087436118] [2019-12-27 19:42:27,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:27,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:28,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 258 states and 469 transitions. [2019-12-27 19:42:28,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:28,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:42:28,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:42:28,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:28,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:42:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:42:28,226 INFO L87 Difference]: Start difference. First operand 20169 states and 61518 transitions. Second operand 8 states. [2019-12-27 19:42:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:30,543 INFO L93 Difference]: Finished difference Result 65876 states and 197235 transitions. [2019-12-27 19:42:30,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 19:42:30,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 19:42:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:30,611 INFO L225 Difference]: With dead ends: 65876 [2019-12-27 19:42:30,611 INFO L226 Difference]: Without dead ends: 48939 [2019-12-27 19:42:30,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:42:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48939 states. [2019-12-27 19:42:31,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48939 to 23714. [2019-12-27 19:42:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23714 states. [2019-12-27 19:42:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23714 states to 23714 states and 72039 transitions. [2019-12-27 19:42:31,212 INFO L78 Accepts]: Start accepts. Automaton has 23714 states and 72039 transitions. Word has length 64 [2019-12-27 19:42:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:31,212 INFO L462 AbstractCegarLoop]: Abstraction has 23714 states and 72039 transitions. [2019-12-27 19:42:31,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:42:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23714 states and 72039 transitions. [2019-12-27 19:42:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:42:31,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:31,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:31,240 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 19:42:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:31,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2111833330, now seen corresponding path program 3 times [2019-12-27 19:42:31,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:31,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041409148] [2019-12-27 19:42:31,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:31,346 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 19:42:31,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041409148] [2019-12-27 19:42:31,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:31,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:42:31,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987194002] [2019-12-27 19:42:31,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:31,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:31,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 374 transitions. [2019-12-27 19:42:31,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:31,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 19:42:31,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:42:31,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:31,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:42:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:42:31,912 INFO L87 Difference]: Start difference. First operand 23714 states and 72039 transitions. Second operand 9 states. [2019-12-27 19:42:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:33,386 INFO L93 Difference]: Finished difference Result 82554 states and 247689 transitions. [2019-12-27 19:42:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 19:42:33,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 19:42:33,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:33,503 INFO L225 Difference]: With dead ends: 82554 [2019-12-27 19:42:33,503 INFO L226 Difference]: Without dead ends: 79843 [2019-12-27 19:42:33,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:42:33,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79843 states. [2019-12-27 19:42:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79843 to 23810. [2019-12-27 19:42:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23810 states. [2019-12-27 19:42:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23810 states to 23810 states and 72383 transitions. [2019-12-27 19:42:34,329 INFO L78 Accepts]: Start accepts. Automaton has 23810 states and 72383 transitions. Word has length 64 [2019-12-27 19:42:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:34,329 INFO L462 AbstractCegarLoop]: Abstraction has 23810 states and 72383 transitions. [2019-12-27 19:42:34,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:42:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 23810 states and 72383 transitions. [2019-12-27 19:42:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:42:34,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:34,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:42:34,358 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 19:42:34,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:34,358 INFO L82 PathProgramCache]: Analyzing trace with hash -740908262, now seen corresponding path program 4 times [2019-12-27 19:42:34,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:34,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592256866] [2019-12-27 19:42:34,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:34,425 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 19:42:34,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592256866] [2019-12-27 19:42:34,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:34,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:42:34,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [905842825] [2019-12-27 19:42:34,426 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:34,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:34,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 268 states and 477 transitions. [2019-12-27 19:42:34,712 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:34,714 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:42:34,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:34,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:34,715 INFO L87 Difference]: Start difference. First operand 23810 states and 72383 transitions. Second operand 3 states. [2019-12-27 19:42:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:34,892 INFO L93 Difference]: Finished difference Result 27826 states and 84546 transitions. [2019-12-27 19:42:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:34,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 19:42:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:34,936 INFO L225 Difference]: With dead ends: 27826 [2019-12-27 19:42:34,936 INFO L226 Difference]: Without dead ends: 27826 [2019-12-27 19:42:34,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 19:42:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27826 states. [2019-12-27 19:42:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27826 to 24707. [2019-12-27 19:42:35,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24707 states. [2019-12-27 19:42:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24707 states to 24707 states and 75346 transitions. [2019-12-27 19:42:35,366 INFO L78 Accepts]: Start accepts. Automaton has 24707 states and 75346 transitions. Word has length 64 [2019-12-27 19:42:35,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:35,366 INFO L462 AbstractCegarLoop]: Abstraction has 24707 states and 75346 transitions. [2019-12-27 19:42:35,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:35,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24707 states and 75346 transitions. [2019-12-27 19:42:35,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:42:35,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:35,397 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 19:42:35,397 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 19:42:35,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:35,398 INFO L82 PathProgramCache]: Analyzing trace with hash 171865286, now seen corresponding path program 1 times [2019-12-27 19:42:35,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:35,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558905645] [2019-12-27 19:42:35,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:35,445 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 19:42:35,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558905645] [2019-12-27 19:42:35,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:35,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:35,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1585059911] [2019-12-27 19:42:35,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:35,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:35,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 235 transitions. [2019-12-27 19:42:35,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:35,909 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:42:35,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:42:35,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:42:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:42:35,911 INFO L87 Difference]: Start difference. First operand 24707 states and 75346 transitions. Second operand 3 states. [2019-12-27 19:42:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:36,137 INFO L93 Difference]: Finished difference Result 33519 states and 102489 transitions. [2019-12-27 19:42:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:42:36,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 19:42:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:36,185 INFO L225 Difference]: With dead ends: 33519 [2019-12-27 19:42:36,185 INFO L226 Difference]: Without dead ends: 33519 [2019-12-27 19:42:36,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 19:42:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33519 states. [2019-12-27 19:42:36,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33519 to 25482. [2019-12-27 19:42:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25482 states. [2019-12-27 19:42:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25482 states to 25482 states and 77744 transitions. [2019-12-27 19:42:36,667 INFO L78 Accepts]: Start accepts. Automaton has 25482 states and 77744 transitions. Word has length 65 [2019-12-27 19:42:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:36,667 INFO L462 AbstractCegarLoop]: Abstraction has 25482 states and 77744 transitions. [2019-12-27 19:42:36,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:42:36,667 INFO L276 IsEmpty]: Start isEmpty. Operand 25482 states and 77744 transitions. [2019-12-27 19:42:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:42:36,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:36,693 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 19:42:36,694 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 19:42:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1092034792, now seen corresponding path program 2 times [2019-12-27 19:42:36,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:36,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141692413] [2019-12-27 19:42:36,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:42:36,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141692413] [2019-12-27 19:42:36,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:36,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:42:36,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789680486] [2019-12-27 19:42:36,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:36,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:36,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 345 transitions. [2019-12-27 19:42:36,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:36,956 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:42:36,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:42:36,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:36,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:42:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:42:36,957 INFO L87 Difference]: Start difference. First operand 25482 states and 77744 transitions. Second operand 5 states. [2019-12-27 19:42:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:37,429 INFO L93 Difference]: Finished difference Result 47429 states and 145042 transitions. [2019-12-27 19:42:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:42:37,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 19:42:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:37,496 INFO L225 Difference]: With dead ends: 47429 [2019-12-27 19:42:37,496 INFO L226 Difference]: Without dead ends: 47429 [2019-12-27 19:42:37,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 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 19:42:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47429 states. [2019-12-27 19:42:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47429 to 27909. [2019-12-27 19:42:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27909 states. [2019-12-27 19:42:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27909 states to 27909 states and 85851 transitions. [2019-12-27 19:42:38,553 INFO L78 Accepts]: Start accepts. Automaton has 27909 states and 85851 transitions. Word has length 65 [2019-12-27 19:42:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:38,553 INFO L462 AbstractCegarLoop]: Abstraction has 27909 states and 85851 transitions. [2019-12-27 19:42:38,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:42:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27909 states and 85851 transitions. [2019-12-27 19:42:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:42:38,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:38,587 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 19:42:38,587 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 19:42:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:38,587 INFO L82 PathProgramCache]: Analyzing trace with hash -779214194, now seen corresponding path program 3 times [2019-12-27 19:42:38,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:38,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558359013] [2019-12-27 19:42:38,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:38,669 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 19:42:38,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558359013] [2019-12-27 19:42:38,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:38,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:42:38,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1806488035] [2019-12-27 19:42:38,671 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:38,691 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:38,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 216 states and 407 transitions. [2019-12-27 19:42:38,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:39,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:42:39,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:42:39,399 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 19:42:39,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:42:39,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:39,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:42:39,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:42:39,401 INFO L87 Difference]: Start difference. First operand 27909 states and 85851 transitions. Second operand 13 states. [2019-12-27 19:42:40,546 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 19:42:40,763 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-27 19:42:40,987 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-27 19:42:41,251 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-27 19:42:41,376 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 19:42:41,523 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 19:42:41,848 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-12-27 19:42:42,122 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-27 19:42:45,439 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-12-27 19:42:45,598 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 19:42:46,123 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 19:42:46,304 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-12-27 19:42:46,450 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 19:42:46,592 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-27 19:42:46,746 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-27 19:42:46,874 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-27 19:42:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:51,540 INFO L93 Difference]: Finished difference Result 148920 states and 453026 transitions. [2019-12-27 19:42:51,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-12-27 19:42:51,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 19:42:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:51,716 INFO L225 Difference]: With dead ends: 148920 [2019-12-27 19:42:51,716 INFO L226 Difference]: Without dead ends: 114399 [2019-12-27 19:42:51,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6068 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=2379, Invalid=12627, Unknown=0, NotChecked=0, Total=15006 [2019-12-27 19:42:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114399 states. [2019-12-27 19:42:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114399 to 31129. [2019-12-27 19:42:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31129 states. [2019-12-27 19:42:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31129 states to 31129 states and 96527 transitions. [2019-12-27 19:42:52,880 INFO L78 Accepts]: Start accepts. Automaton has 31129 states and 96527 transitions. Word has length 65 [2019-12-27 19:42:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:52,880 INFO L462 AbstractCegarLoop]: Abstraction has 31129 states and 96527 transitions. [2019-12-27 19:42:52,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:42:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 31129 states and 96527 transitions. [2019-12-27 19:42:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:42:52,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:52,913 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 19:42:52,914 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 19:42:52,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash -196054064, now seen corresponding path program 4 times [2019-12-27 19:42:52,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:52,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028406288] [2019-12-27 19:42:52,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:53,002 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 19:42:53,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028406288] [2019-12-27 19:42:53,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:53,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:42:53,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019100971] [2019-12-27 19:42:53,003 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:53,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:53,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 361 transitions. [2019-12-27 19:42:53,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:53,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:42:53,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:42:53,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:42:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:42:53,552 INFO L87 Difference]: Start difference. First operand 31129 states and 96527 transitions. Second operand 4 states. [2019-12-27 19:42:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:53,723 INFO L93 Difference]: Finished difference Result 30856 states and 95534 transitions. [2019-12-27 19:42:53,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:42:53,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 19:42:53,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:53,769 INFO L225 Difference]: With dead ends: 30856 [2019-12-27 19:42:53,769 INFO L226 Difference]: Without dead ends: 30856 [2019-12-27 19:42:53,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 5 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 19:42:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30856 states. [2019-12-27 19:42:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30856 to 26320. [2019-12-27 19:42:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26320 states. [2019-12-27 19:42:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26320 states to 26320 states and 80594 transitions. [2019-12-27 19:42:54,258 INFO L78 Accepts]: Start accepts. Automaton has 26320 states and 80594 transitions. Word has length 65 [2019-12-27 19:42:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:42:54,258 INFO L462 AbstractCegarLoop]: Abstraction has 26320 states and 80594 transitions. [2019-12-27 19:42:54,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:42:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26320 states and 80594 transitions. [2019-12-27 19:42:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:42:54,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:42:54,284 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 19:42:54,284 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 19:42:54,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:42:54,284 INFO L82 PathProgramCache]: Analyzing trace with hash -163905342, now seen corresponding path program 1 times [2019-12-27 19:42:54,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:42:54,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475711124] [2019-12-27 19:42:54,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:42:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:42:54,388 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 19:42:54,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475711124] [2019-12-27 19:42:54,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:42:54,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:42:54,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [167261142] [2019-12-27 19:42:54,390 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:42:54,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:42:54,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 482 transitions. [2019-12-27 19:42:54,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:42:54,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 19:42:54,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:42:54,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:42:54,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:42:54,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:42:54,770 INFO L87 Difference]: Start difference. First operand 26320 states and 80594 transitions. Second operand 11 states. [2019-12-27 19:42:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:42:59,727 INFO L93 Difference]: Finished difference Result 81213 states and 243800 transitions. [2019-12-27 19:42:59,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 19:42:59,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 19:42:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:42:59,837 INFO L225 Difference]: With dead ends: 81213 [2019-12-27 19:42:59,838 INFO L226 Difference]: Without dead ends: 80905 [2019-12-27 19:42:59,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=511, Invalid=2569, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:43:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80905 states. [2019-12-27 19:43:00,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80905 to 33608. [2019-12-27 19:43:00,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33608 states. [2019-12-27 19:43:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33608 states to 33608 states and 102225 transitions. [2019-12-27 19:43:00,830 INFO L78 Accepts]: Start accepts. Automaton has 33608 states and 102225 transitions. Word has length 65 [2019-12-27 19:43:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:00,830 INFO L462 AbstractCegarLoop]: Abstraction has 33608 states and 102225 transitions. [2019-12-27 19:43:00,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:43:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 33608 states and 102225 transitions. [2019-12-27 19:43:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:43:00,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:00,864 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 19:43:00,864 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 19:43:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1320269470, now seen corresponding path program 2 times [2019-12-27 19:43:00,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:00,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476861963] [2019-12-27 19:43:00,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:43:00,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476861963] [2019-12-27 19:43:00,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:00,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:43:00,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [823303433] [2019-12-27 19:43:00,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:01,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:01,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 306 states and 529 transitions. [2019-12-27 19:43:01,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:01,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:43:01,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:43:01,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:01,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:43:01,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:43:01,305 INFO L87 Difference]: Start difference. First operand 33608 states and 102225 transitions. Second operand 8 states. [2019-12-27 19:43:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:03,228 INFO L93 Difference]: Finished difference Result 54896 states and 164308 transitions. [2019-12-27 19:43:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 19:43:03,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 19:43:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:03,309 INFO L225 Difference]: With dead ends: 54896 [2019-12-27 19:43:03,309 INFO L226 Difference]: Without dead ends: 54652 [2019-12-27 19:43:03,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:43:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54652 states. [2019-12-27 19:43:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54652 to 38817. [2019-12-27 19:43:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38817 states. [2019-12-27 19:43:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38817 states to 38817 states and 117458 transitions. [2019-12-27 19:43:04,405 INFO L78 Accepts]: Start accepts. Automaton has 38817 states and 117458 transitions. Word has length 65 [2019-12-27 19:43:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:04,405 INFO L462 AbstractCegarLoop]: Abstraction has 38817 states and 117458 transitions. [2019-12-27 19:43:04,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:43:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 38817 states and 117458 transitions. [2019-12-27 19:43:04,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:43:04,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:04,445 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 19:43:04,446 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 19:43:04,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:04,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1718170818, now seen corresponding path program 3 times [2019-12-27 19:43:04,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:04,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956940711] [2019-12-27 19:43:04,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:04,507 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 19:43:04,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956940711] [2019-12-27 19:43:04,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:04,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:04,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817487841] [2019-12-27 19:43:04,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:04,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:04,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 306 transitions. [2019-12-27 19:43:04,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:04,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:43:04,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:43:04,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:43:04,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:43:04,740 INFO L87 Difference]: Start difference. First operand 38817 states and 117458 transitions. Second operand 3 states. [2019-12-27 19:43:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:04,902 INFO L93 Difference]: Finished difference Result 38817 states and 117457 transitions. [2019-12-27 19:43:04,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:43:04,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 19:43:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:04,976 INFO L225 Difference]: With dead ends: 38817 [2019-12-27 19:43:04,976 INFO L226 Difference]: Without dead ends: 38817 [2019-12-27 19:43:04,976 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 19:43:05,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38817 states. [2019-12-27 19:43:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38817 to 29726. [2019-12-27 19:43:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29726 states. [2019-12-27 19:43:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29726 states to 29726 states and 92049 transitions. [2019-12-27 19:43:05,563 INFO L78 Accepts]: Start accepts. Automaton has 29726 states and 92049 transitions. Word has length 65 [2019-12-27 19:43:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:05,563 INFO L462 AbstractCegarLoop]: Abstraction has 29726 states and 92049 transitions. [2019-12-27 19:43:05,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:43:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 29726 states and 92049 transitions. [2019-12-27 19:43:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:43:05,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:05,597 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 19:43:05,597 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 19:43:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash -677621720, now seen corresponding path program 1 times [2019-12-27 19:43:05,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:05,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745357104] [2019-12-27 19:43:05,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:05,649 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 19:43:05,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745357104] [2019-12-27 19:43:05,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:05,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:43:05,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [631090152] [2019-12-27 19:43:05,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:05,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:05,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 483 transitions. [2019-12-27 19:43:05,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:05,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:43:05,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:43:05,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:05,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:43:05,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:43:05,947 INFO L87 Difference]: Start difference. First operand 29726 states and 92049 transitions. Second operand 4 states. [2019-12-27 19:43:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:06,235 INFO L93 Difference]: Finished difference Result 32907 states and 98558 transitions. [2019-12-27 19:43:06,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:43:06,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 19:43:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:06,280 INFO L225 Difference]: With dead ends: 32907 [2019-12-27 19:43:06,280 INFO L226 Difference]: Without dead ends: 32907 [2019-12-27 19:43:06,281 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 19:43:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32907 states. [2019-12-27 19:43:06,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32907 to 22808. [2019-12-27 19:43:06,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22808 states. [2019-12-27 19:43:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22808 states to 22808 states and 69024 transitions. [2019-12-27 19:43:06,997 INFO L78 Accepts]: Start accepts. Automaton has 22808 states and 69024 transitions. Word has length 66 [2019-12-27 19:43:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:06,998 INFO L462 AbstractCegarLoop]: Abstraction has 22808 states and 69024 transitions. [2019-12-27 19:43:06,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:43:06,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22808 states and 69024 transitions. [2019-12-27 19:43:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:43:07,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:07,021 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 19:43:07,021 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 19:43:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash -466576635, now seen corresponding path program 1 times [2019-12-27 19:43:07,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:07,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910853953] [2019-12-27 19:43:07,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:07,196 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 19:43:07,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910853953] [2019-12-27 19:43:07,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:07,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:43:07,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760327635] [2019-12-27 19:43:07,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:07,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:07,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 427 transitions. [2019-12-27 19:43:07,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:07,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:43:07,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:43:07,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:07,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:43:07,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:43:07,570 INFO L87 Difference]: Start difference. First operand 22808 states and 69024 transitions. Second operand 12 states. [2019-12-27 19:43:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:09,041 INFO L93 Difference]: Finished difference Result 33043 states and 99263 transitions. [2019-12-27 19:43:09,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 19:43:09,041 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 19:43:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:09,084 INFO L225 Difference]: With dead ends: 33043 [2019-12-27 19:43:09,084 INFO L226 Difference]: Without dead ends: 27653 [2019-12-27 19:43:09,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:43:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27653 states. [2019-12-27 19:43:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27653 to 23286. [2019-12-27 19:43:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23286 states. [2019-12-27 19:43:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23286 states to 23286 states and 70318 transitions. [2019-12-27 19:43:09,489 INFO L78 Accepts]: Start accepts. Automaton has 23286 states and 70318 transitions. Word has length 67 [2019-12-27 19:43:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:09,490 INFO L462 AbstractCegarLoop]: Abstraction has 23286 states and 70318 transitions. [2019-12-27 19:43:09,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:43:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 23286 states and 70318 transitions. [2019-12-27 19:43:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:43:09,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:09,516 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 19:43:09,516 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 19:43:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:09,516 INFO L82 PathProgramCache]: Analyzing trace with hash 636143591, now seen corresponding path program 2 times [2019-12-27 19:43:09,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:09,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801504375] [2019-12-27 19:43:09,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:09,656 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 19:43:09,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801504375] [2019-12-27 19:43:09,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:09,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:43:09,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [631943012] [2019-12-27 19:43:09,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:09,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:10,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 595 transitions. [2019-12-27 19:43:10,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:10,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:10,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:10,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:10,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:10,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:10,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:43:10,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:43:10,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:43:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:43:10,449 INFO L87 Difference]: Start difference. First operand 23286 states and 70318 transitions. Second operand 16 states. [2019-12-27 19:43:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:13,706 INFO L93 Difference]: Finished difference Result 35531 states and 105355 transitions. [2019-12-27 19:43:13,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 19:43:13,707 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 19:43:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:13,746 INFO L225 Difference]: With dead ends: 35531 [2019-12-27 19:43:13,746 INFO L226 Difference]: Without dead ends: 30121 [2019-12-27 19:43:13,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:43:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30121 states. [2019-12-27 19:43:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30121 to 23558. [2019-12-27 19:43:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23558 states. [2019-12-27 19:43:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23558 states to 23558 states and 71053 transitions. [2019-12-27 19:43:14,173 INFO L78 Accepts]: Start accepts. Automaton has 23558 states and 71053 transitions. Word has length 67 [2019-12-27 19:43:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:14,173 INFO L462 AbstractCegarLoop]: Abstraction has 23558 states and 71053 transitions. [2019-12-27 19:43:14,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:43:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 23558 states and 71053 transitions. [2019-12-27 19:43:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:43:14,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:14,202 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 19:43:14,202 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:14,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1587369369, now seen corresponding path program 3 times [2019-12-27 19:43:14,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:14,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252009905] [2019-12-27 19:43:14,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:14,352 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 19:43:14,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252009905] [2019-12-27 19:43:14,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:14,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:43:14,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772165664] [2019-12-27 19:43:14,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:14,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:14,668 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 264 states and 493 transitions. [2019-12-27 19:43:14,668 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:14,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:14,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:43:14,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:43:14,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:14,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:43:14,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:43:14,936 INFO L87 Difference]: Start difference. First operand 23558 states and 71053 transitions. Second operand 15 states. [2019-12-27 19:43:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:16,774 INFO L93 Difference]: Finished difference Result 32001 states and 95369 transitions. [2019-12-27 19:43:16,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:43:16,774 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 19:43:16,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:16,815 INFO L225 Difference]: With dead ends: 32001 [2019-12-27 19:43:16,815 INFO L226 Difference]: Without dead ends: 28826 [2019-12-27 19:43:16,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:43:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28826 states. [2019-12-27 19:43:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28826 to 23178. [2019-12-27 19:43:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23178 states. [2019-12-27 19:43:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23178 states to 23178 states and 69957 transitions. [2019-12-27 19:43:17,217 INFO L78 Accepts]: Start accepts. Automaton has 23178 states and 69957 transitions. Word has length 67 [2019-12-27 19:43:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:17,217 INFO L462 AbstractCegarLoop]: Abstraction has 23178 states and 69957 transitions. [2019-12-27 19:43:17,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:43:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 23178 states and 69957 transitions. [2019-12-27 19:43:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:43:17,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:17,246 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 19:43:17,246 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash -638378747, now seen corresponding path program 4 times [2019-12-27 19:43:17,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:17,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404801886] [2019-12-27 19:43:17,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:17,738 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 19:43:17,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404801886] [2019-12-27 19:43:17,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:17,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 19:43:17,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [69858798] [2019-12-27 19:43:17,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:17,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:18,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 495 transitions. [2019-12-27 19:43:18,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 19:43:18,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:18,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:19,167 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-27 19:43:19,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:43:19,463 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-12-27 19:43:19,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 19:43:19,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 19:43:19,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:19,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 19:43:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:43:19,706 INFO L87 Difference]: Start difference. First operand 23178 states and 69957 transitions. Second operand 27 states. [2019-12-27 19:43:23,245 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 18 [2019-12-27 19:43:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:24,879 INFO L93 Difference]: Finished difference Result 26814 states and 79330 transitions. [2019-12-27 19:43:24,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 19:43:24,880 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2019-12-27 19:43:24,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:24,939 INFO L225 Difference]: With dead ends: 26814 [2019-12-27 19:43:24,939 INFO L226 Difference]: Without dead ends: 24761 [2019-12-27 19:43:24,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 13 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=256, Invalid=1906, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 19:43:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24761 states. [2019-12-27 19:43:25,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24761 to 22585. [2019-12-27 19:43:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22585 states. [2019-12-27 19:43:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22585 states to 22585 states and 67639 transitions. [2019-12-27 19:43:25,461 INFO L78 Accepts]: Start accepts. Automaton has 22585 states and 67639 transitions. Word has length 67 [2019-12-27 19:43:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:25,462 INFO L462 AbstractCegarLoop]: Abstraction has 22585 states and 67639 transitions. [2019-12-27 19:43:25,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 19:43:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 22585 states and 67639 transitions. [2019-12-27 19:43:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:43:25,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:25,485 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 19:43:25,485 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash -376488081, now seen corresponding path program 5 times [2019-12-27 19:43:25,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:25,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281990099] [2019-12-27 19:43:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:43:25,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 19:43:25,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281990099] [2019-12-27 19:43:25,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:43:25,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:43:25,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2039147431] [2019-12-27 19:43:25,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:43:25,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:43:25,880 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 254 states and 470 transitions. [2019-12-27 19:43:25,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:43:26,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 19:43:26,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:43:26,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:43:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:43:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:43:26,075 INFO L87 Difference]: Start difference. First operand 22585 states and 67639 transitions. Second operand 13 states. [2019-12-27 19:43:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:43:27,804 INFO L93 Difference]: Finished difference Result 44496 states and 131575 transitions. [2019-12-27 19:43:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 19:43:27,804 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 19:43:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:43:27,850 INFO L225 Difference]: With dead ends: 44496 [2019-12-27 19:43:27,850 INFO L226 Difference]: Without dead ends: 36226 [2019-12-27 19:43:27,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 19:43:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36226 states. [2019-12-27 19:43:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36226 to 21576. [2019-12-27 19:43:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21576 states. [2019-12-27 19:43:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21576 states to 21576 states and 64549 transitions. [2019-12-27 19:43:28,255 INFO L78 Accepts]: Start accepts. Automaton has 21576 states and 64549 transitions. Word has length 67 [2019-12-27 19:43:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:43:28,256 INFO L462 AbstractCegarLoop]: Abstraction has 21576 states and 64549 transitions. [2019-12-27 19:43:28,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:43:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21576 states and 64549 transitions. [2019-12-27 19:43:28,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:43:28,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:43:28,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:43:28,277 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:43:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:43:28,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1050036249, now seen corresponding path program 6 times [2019-12-27 19:43:28,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:43:28,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897830358] [2019-12-27 19:43:28,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:43:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:43:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:43:28,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:43:28,385 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:43:28,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= 0 v_~z$r_buff1_thd2~0_19) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$w_buff1~0_25) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t68~0.base_27| 4)) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$w_buff0_used~0_112 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~x~0_10 0) (= |v_ULTIMATE.start_main_~#t68~0.offset_19| 0) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$r_buff1_thd0~0_23) (= 0 v_~z$w_buff1_used~0_70) (= 0 v_~weak$$choice0~0_7) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~z~0_25 0) (= 0 |v_#NULL.base_7|) (= 0 v_~y~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t68~0.base_27|)) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~z$r_buff1_thd3~0_47) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~__unbuffered_p1_EBX~0_13 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t68~0.base_27|) (= v_~z$r_buff0_thd2~0_21 0) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t68~0.base_27| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t68~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t68~0.base_27|) |v_ULTIMATE.start_main_~#t68~0.offset_19| 0)) |v_#memory_int_21|) (= v_~z$r_buff0_thd1~0_28 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_19, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t68~0.offset=|v_ULTIMATE.start_main_~#t68~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t70~0.offset=|v_ULTIMATE.start_main_~#t70~0.offset_15|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_~#t70~0.base=|v_ULTIMATE.start_main_~#t70~0.base_18|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~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_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_25, ULTIMATE.start_main_~#t69~0.offset=|v_ULTIMATE.start_main_~#t69~0.offset_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~y~0=v_~y~0_8, ULTIMATE.start_main_~#t69~0.base=|v_ULTIMATE.start_main_~#t69~0.base_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_47, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t68~0.base=|v_ULTIMATE.start_main_~#t68~0.base_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t68~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t70~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t70~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t69~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t69~0.base, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t68~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:43:28,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L750: Formula: (and (= 1 ~z$r_buff0_thd1~0_Out662161426) (= ~z$r_buff0_thd3~0_In662161426 ~z$r_buff1_thd3~0_Out662161426) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In662161426)) (= ~x~0_In662161426 ~__unbuffered_p0_EAX~0_Out662161426) (= ~z$r_buff0_thd1~0_In662161426 ~z$r_buff1_thd1~0_Out662161426) (= ~z$r_buff1_thd2~0_Out662161426 ~z$r_buff0_thd2~0_In662161426) (= ~z$r_buff0_thd0~0_In662161426 ~z$r_buff1_thd0~0_Out662161426)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In662161426, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In662161426, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In662161426, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In662161426, ~x~0=~x~0_In662161426, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In662161426} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out662161426, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In662161426, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out662161426, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out662161426, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out662161426, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out662161426, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In662161426, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In662161426, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out662161426, ~x~0=~x~0_In662161426, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In662161426} 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 19:43:28,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t69~0.offset_10| 0) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t69~0.base_11|) 0) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t69~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t69~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t69~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t69~0.base_11|) |v_ULTIMATE.start_main_~#t69~0.offset_10| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t69~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t69~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t69~0.offset=|v_ULTIMATE.start_main_~#t69~0.offset_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t69~0.base=|v_ULTIMATE.start_main_~#t69~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t69~0.offset, #length, ULTIMATE.start_main_~#t69~0.base] because there is no mapped edge [2019-12-27 19:43:28,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L834-1-->L836: Formula: (and (not (= |v_ULTIMATE.start_main_~#t70~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t70~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t70~0.base_11|) |v_ULTIMATE.start_main_~#t70~0.offset_10| 2)) |v_#memory_int_13|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t70~0.base_11| 1) |v_#valid_31|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t70~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t70~0.offset_10|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t70~0.base_11|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t70~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t70~0.offset=|v_ULTIMATE.start_main_~#t70~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t70~0.base=|v_ULTIMATE.start_main_~#t70~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t70~0.offset, ULTIMATE.start_main_~#t70~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 19:43:28,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L773-2-->L773-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out-1147781208| |P1Thread1of1ForFork2_#t~ite9_Out-1147781208|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1147781208 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1147781208 256) 0))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1147781208| ~z$w_buff1~0_In-1147781208) (not .cse2)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-1147781208| ~z~0_In-1147781208) (or .cse1 .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1147781208, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147781208, ~z$w_buff1~0=~z$w_buff1~0_In-1147781208, ~z~0=~z~0_In-1147781208} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1147781208|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1147781208, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-1147781208|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1147781208, ~z$w_buff1~0=~z$w_buff1~0_In-1147781208, ~z~0=~z~0_In-1147781208} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 19:43:28,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1936061990 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1936061990 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1936061990| ~z$w_buff0_used~0_In1936061990)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out1936061990| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1936061990, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1936061990} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1936061990, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1936061990|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1936061990} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 19:43:28,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2089958339 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2089958339 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In2089958339 |P0Thread1of1ForFork1_#t~ite5_Out2089958339|)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out2089958339|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2089958339, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2089958339} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out2089958339|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2089958339, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2089958339} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 19:43:28,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-813173510 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-813173510 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-813173510 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-813173510 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-813173510|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-813173510 |P0Thread1of1ForFork1_#t~ite6_Out-813173510|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-813173510, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-813173510, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-813173510, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-813173510} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-813173510, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-813173510|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-813173510, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-813173510, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-813173510} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 19:43:28,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-430261310 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-430261310 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-430261310 ~z$r_buff0_thd1~0_In-430261310) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out-430261310 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-430261310, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-430261310} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-430261310, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-430261310|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-430261310} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:43:28,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1699965945 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1699965945 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1699965945 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1699965945 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1699965945 |P0Thread1of1ForFork1_#t~ite8_Out1699965945|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1699965945|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1699965945, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1699965945, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699965945, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1699965945} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1699965945|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1699965945, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1699965945, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1699965945, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1699965945} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 19:43:28,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1890345947 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1890345947 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1890345947 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1890345947 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1890345947| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1890345947 |P1Thread1of1ForFork2_#t~ite12_Out1890345947|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1890345947, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1890345947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1890345947, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1890345947} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1890345947, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1890345947, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1890345947, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1890345947|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1890345947} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 19:43:28,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-665034571 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-665034571 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-665034571 |P1Thread1of1ForFork2_#t~ite13_Out-665034571|)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-665034571| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-665034571, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-665034571} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-665034571, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-665034571|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-665034571} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 19:43:28,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1113866967 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1113866967 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1113866967 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1113866967 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-1113866967 |P1Thread1of1ForFork2_#t~ite14_Out-1113866967|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1113866967|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113866967, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1113866967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1113866967, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1113866967} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1113866967, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1113866967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1113866967, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1113866967|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1113866967} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 19:43:28,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L777-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_16) (= (+ 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_16, ~__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 19:43:28,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} 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_14, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} 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 19:43:28,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1476891503 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1476891503 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1476891503 256) 0) .cse0) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In1476891503 256) 0)) (= (mod ~z$w_buff0_used~0_In1476891503 256) 0))) (= ~z$w_buff1_used~0_In1476891503 |P2Thread1of1ForFork0_#t~ite29_Out1476891503|) (= |P2Thread1of1ForFork0_#t~ite30_Out1476891503| |P2Thread1of1ForFork0_#t~ite29_Out1476891503|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite29_In1476891503| |P2Thread1of1ForFork0_#t~ite29_Out1476891503|) (= ~z$w_buff1_used~0_In1476891503 |P2Thread1of1ForFork0_#t~ite30_Out1476891503|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1476891503, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1476891503, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1476891503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1476891503, ~weak$$choice2~0=~weak$$choice2~0_In1476891503, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1476891503|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1476891503, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1476891503, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1476891503, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1476891503, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1476891503|, ~weak$$choice2~0=~weak$$choice2~0_In1476891503, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1476891503|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 19:43:28,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L802-->L803: Formula: (and (= v_~z$r_buff0_thd3~0_51 v_~z$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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 19:43:28,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L805-->L809: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) 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_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 19:43:28,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-67243437 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-67243437 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-67243437 |P2Thread1of1ForFork0_#t~ite38_Out-67243437|)) (and (= ~z~0_In-67243437 |P2Thread1of1ForFork0_#t~ite38_Out-67243437|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-67243437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-67243437, ~z$w_buff1~0=~z$w_buff1~0_In-67243437, ~z~0=~z~0_In-67243437} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-67243437|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-67243437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-67243437, ~z$w_buff1~0=~z$w_buff1~0_In-67243437, ~z~0=~z~0_In-67243437} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 19:43:28,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L809-4-->L810: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 19:43:28,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1178105438 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1178105438 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1178105438| ~z$w_buff0_used~0_In1178105438)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1178105438| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1178105438, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1178105438} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1178105438, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1178105438|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1178105438} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 19:43:28,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2144801074 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2144801074 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2144801074 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-2144801074 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-2144801074| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2144801074| ~z$w_buff1_used~0_In-2144801074) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144801074, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2144801074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144801074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2144801074} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144801074, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2144801074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144801074, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2144801074, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2144801074|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 19:43:28,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In677168881 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In677168881 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out677168881|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out677168881| ~z$r_buff0_thd3~0_In677168881)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In677168881, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In677168881} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In677168881, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In677168881, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out677168881|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:43:28,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In328413563 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In328413563 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In328413563 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In328413563 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out328413563|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite43_Out328413563| ~z$r_buff1_thd3~0_In328413563)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In328413563, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In328413563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328413563, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In328413563} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out328413563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In328413563, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In328413563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In328413563, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In328413563} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 19:43:28,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |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_15} 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_14, 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 19:43:28,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L836-1-->L842: 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 19:43:28,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out874458350| |ULTIMATE.start_main_#t~ite48_Out874458350|)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In874458350 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In874458350 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out874458350| ~z~0_In874458350) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out874458350| ~z$w_buff1~0_In874458350)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874458350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874458350, ~z$w_buff1~0=~z$w_buff1~0_In874458350, ~z~0=~z~0_In874458350} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In874458350, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out874458350|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In874458350, ~z$w_buff1~0=~z$w_buff1~0_In874458350, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out874458350|, ~z~0=~z~0_In874458350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 19:43:28,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-588693704 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-588693704 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-588693704| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-588693704| ~z$w_buff0_used~0_In-588693704)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-588693704, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-588693704} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-588693704, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-588693704, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-588693704|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 19:43:28,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L844-->L844-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1539498019 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1539498019 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1539498019 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1539498019 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1539498019 |ULTIMATE.start_main_#t~ite50_Out-1539498019|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1539498019|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1539498019, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539498019, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1539498019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1539498019} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1539498019|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1539498019, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1539498019, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1539498019, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1539498019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 19:43:28,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-638289171 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-638289171 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-638289171|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-638289171 |ULTIMATE.start_main_#t~ite51_Out-638289171|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-638289171, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-638289171} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-638289171, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-638289171|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-638289171} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 19:43:28,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1061431393 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1061431393 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1061431393 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1061431393 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1061431393| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out1061431393| ~z$r_buff1_thd0~0_In1061431393) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1061431393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1061431393, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1061431393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1061431393} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1061431393|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1061431393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1061431393, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1061431393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1061431393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 19:43:28,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~z$r_buff1_thd0~0_16) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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 19:43:28,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:43:28 BasicIcfg [2019-12-27 19:43:28,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:43:28,517 INFO L168 Benchmark]: Toolchain (without parser) took 144517.55 ms. Allocated memory was 145.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 102.5 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 19:43:28,518 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 19:43:28,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.92 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.1 MB in the beginning and 156.5 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 19:43:28,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.25 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:43:28,519 INFO L168 Benchmark]: Boogie Preprocessor took 40.16 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:43:28,519 INFO L168 Benchmark]: RCFGBuilder took 937.59 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:43:28,520 INFO L168 Benchmark]: TraceAbstraction took 142650.28 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 19:43:28,522 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.20 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.92 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 102.1 MB in the beginning and 156.5 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 62.25 ms. Allocated memory is still 202.9 MB. Free memory was 155.9 MB in the beginning and 153.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.16 ms. Allocated memory is still 202.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 937.59 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 100.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142650.28 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 100.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 178 ProgramPointsBefore, 95 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7190 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85139 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t68, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$w_buff1 = z$w_buff0 [L736] 1 z$w_buff0 = 1 [L737] 1 z$w_buff1_used = z$w_buff0_used [L738] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t69, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L773] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L836] FCALL, FORK 0 pthread_create(&t70, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 [L790] 3 __unbuffered_p2_EAX = y [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L775] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L798] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L842] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 142.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 59.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8347 SDtfs, 11979 SDslu, 31280 SDs, 0 SdLazy, 26184 SolverSat, 719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 806 GetRequests, 207 SyntacticMatches, 93 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8481 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155734occurred 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: 46.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 454946 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1451 ConstructedInterpolants, 0 QuantifiedInterpolants, 291015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...