/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/mix006_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:49:01,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:49:01,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:49:01,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:49:01,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:49:01,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:49:01,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:49:01,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:49:01,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:49:01,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:49:01,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:49:01,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:49:01,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:49:01,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:49:01,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:49:01,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:49:01,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:49:01,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:49:01,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:49:01,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:49:01,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:49:01,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:49:01,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:49:01,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:49:01,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:49:01,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:49:01,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:49:01,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:49:01,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:49:01,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:49:01,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:49:01,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:49:01,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:49:01,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:49:01,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:49:01,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:49:01,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:49:01,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:49:01,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:49:01,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:49:01,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:49:01,820 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:49:01,842 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:49:01,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:49:01,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:49:01,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:49:01,844 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:49:01,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:49:01,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:49:01,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:49:01,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:49:01,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:49:01,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:49:01,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:49:01,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:49:01,847 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:49:01,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:49:01,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:49:01,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:49:01,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:49:01,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:49:01,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:49:01,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:49:01,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:49:01,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:49:01,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:49:01,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:49:01,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:49:01,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:49:01,850 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:49:01,850 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:49:01,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:49:01,852 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:49:01,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:49:02,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:49:02,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:49:02,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:49:02,149 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:49:02,150 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:49:02,150 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 19:49:02,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdc311bd/c8f248016f124a969f07dfddc9934b9b/FLAGa5291f975 [2019-12-27 19:49:02,799 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:49:02,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 19:49:02,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdc311bd/c8f248016f124a969f07dfddc9934b9b/FLAGa5291f975 [2019-12-27 19:49:03,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdc311bd/c8f248016f124a969f07dfddc9934b9b [2019-12-27 19:49:03,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:49:03,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:49:03,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:49:03,057 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:49:03,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:49:03,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9a81ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03, skipping insertion in model container [2019-12-27 19:49:03,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:49:03,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:49:03,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:49:03,683 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:49:03,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:49:03,815 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:49:03,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03 WrapperNode [2019-12-27 19:49:03,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:49:03,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:49:03,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:49:03,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:49:03,825 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:49:03" (1/1) ... [2019-12-27 19:49:03,849 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:49:03" (1/1) ... [2019-12-27 19:49:03,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:49:03,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:49:03,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:49:03,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:49:03,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (1/1) ... [2019-12-27 19:49:03,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:49:03,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:49:03,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:49:03,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:49:03,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (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:49:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:49:03,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:49:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:49:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:49:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:49:03,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:49:03,993 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:49:03,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:49:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:49:03,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:49:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:49:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:49:03,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:49:03,996 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:49:04,888 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:49:04,888 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:49:04,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:49:04 BoogieIcfgContainer [2019-12-27 19:49:04,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:49:04,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:49:04,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:49:04,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:49:04,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:49:03" (1/3) ... [2019-12-27 19:49:04,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713733a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:49:04, skipping insertion in model container [2019-12-27 19:49:04,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:49:03" (2/3) ... [2019-12-27 19:49:04,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713733a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:49:04, skipping insertion in model container [2019-12-27 19:49:04,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:49:04" (3/3) ... [2019-12-27 19:49:04,898 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_pso.oepc.i [2019-12-27 19:49:04,908 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:49:04,909 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:49:04,916 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:49:04,917 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:49:04,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,960 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,961 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,994 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:04,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,022 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:49:05,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:49:05,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:49:05,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:49:05,074 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:49:05,074 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:49:05,074 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:49:05,074 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:49:05,074 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:49:05,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:49:05,091 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 19:49:05,093 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 19:49:05,199 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 19:49:05,199 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:49:05,215 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:49:05,239 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 19:49:05,293 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 19:49:05,294 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:49:05,301 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 19:49:05,322 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 19:49:05,323 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:49:08,924 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 19:49:09,082 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 19:49:09,103 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82443 [2019-12-27 19:49:09,104 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 19:49:09,108 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 19:49:30,360 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120992 states. [2019-12-27 19:49:30,363 INFO L276 IsEmpty]: Start isEmpty. Operand 120992 states. [2019-12-27 19:49:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:49:30,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:49:30,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:49:30,371 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:49:30,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:49:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash 913992, now seen corresponding path program 1 times [2019-12-27 19:49:30,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:49:30,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251590485] [2019-12-27 19:49:30,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:49:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:49:30,596 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:49:30,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251590485] [2019-12-27 19:49:30,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:49:30,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:49:30,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276169613] [2019-12-27 19:49:30,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:49:30,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:49:30,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:49:30,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:49:30,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:49:30,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:49:30,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:49:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:49:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:49:30,640 INFO L87 Difference]: Start difference. First operand 120992 states. Second operand 3 states. [2019-12-27 19:49:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:49:32,219 INFO L93 Difference]: Finished difference Result 119518 states and 508908 transitions. [2019-12-27 19:49:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:49:32,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:49:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:49:33,212 INFO L225 Difference]: With dead ends: 119518 [2019-12-27 19:49:33,212 INFO L226 Difference]: Without dead ends: 112056 [2019-12-27 19:49:33,214 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:49:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112056 states. [2019-12-27 19:49:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112056 to 112056. [2019-12-27 19:49:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112056 states. [2019-12-27 19:49:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112056 states to 112056 states and 476484 transitions. [2019-12-27 19:49:47,569 INFO L78 Accepts]: Start accepts. Automaton has 112056 states and 476484 transitions. Word has length 3 [2019-12-27 19:49:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:49:47,569 INFO L462 AbstractCegarLoop]: Abstraction has 112056 states and 476484 transitions. [2019-12-27 19:49:47,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:49:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 112056 states and 476484 transitions. [2019-12-27 19:49:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:49:47,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:49:47,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:49:47,573 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:49:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:49:47,574 INFO L82 PathProgramCache]: Analyzing trace with hash -224245043, now seen corresponding path program 1 times [2019-12-27 19:49:47,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:49:47,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888619132] [2019-12-27 19:49:47,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:49:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:49:47,681 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:49:47,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888619132] [2019-12-27 19:49:47,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:49:47,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:49:47,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [438243969] [2019-12-27 19:49:47,683 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:49:47,685 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:49:47,690 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:49:47,691 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:49:47,691 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:49:47,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:49:47,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:49:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:49:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:49:47,694 INFO L87 Difference]: Start difference. First operand 112056 states and 476484 transitions. Second operand 4 states. [2019-12-27 19:49:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:49:53,216 INFO L93 Difference]: Finished difference Result 173434 states and 704626 transitions. [2019-12-27 19:49:53,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:49:53,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 19:49:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:49:53,828 INFO L225 Difference]: With dead ends: 173434 [2019-12-27 19:49:53,828 INFO L226 Difference]: Without dead ends: 173385 [2019-12-27 19:49:53,829 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:49:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173385 states. [2019-12-27 19:50:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173385 to 158867. [2019-12-27 19:50:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158867 states. [2019-12-27 19:50:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158867 states to 158867 states and 654272 transitions. [2019-12-27 19:50:02,951 INFO L78 Accepts]: Start accepts. Automaton has 158867 states and 654272 transitions. Word has length 11 [2019-12-27 19:50:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:02,951 INFO L462 AbstractCegarLoop]: Abstraction has 158867 states and 654272 transitions. [2019-12-27 19:50:02,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:50:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 158867 states and 654272 transitions. [2019-12-27 19:50:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:50:02,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:02,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:50:02,960 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:50:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:02,961 INFO L82 PathProgramCache]: Analyzing trace with hash 703391521, now seen corresponding path program 1 times [2019-12-27 19:50:02,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:02,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015132046] [2019-12-27 19:50:02,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:03,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:50:03,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015132046] [2019-12-27 19:50:03,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:03,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:50:03,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135679609] [2019-12-27 19:50:03,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:03,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:03,055 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:50:03,056 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:03,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:03,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:50:03,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:03,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:50:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:50:03,062 INFO L87 Difference]: Start difference. First operand 158867 states and 654272 transitions. Second operand 3 states. [2019-12-27 19:50:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:03,214 INFO L93 Difference]: Finished difference Result 34345 states and 110990 transitions. [2019-12-27 19:50:03,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:50:03,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 19:50:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:03,270 INFO L225 Difference]: With dead ends: 34345 [2019-12-27 19:50:03,270 INFO L226 Difference]: Without dead ends: 34345 [2019-12-27 19:50:03,270 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:50:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2019-12-27 19:50:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 34345. [2019-12-27 19:50:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34345 states. [2019-12-27 19:50:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34345 states to 34345 states and 110990 transitions. [2019-12-27 19:50:08,777 INFO L78 Accepts]: Start accepts. Automaton has 34345 states and 110990 transitions. Word has length 13 [2019-12-27 19:50:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:08,777 INFO L462 AbstractCegarLoop]: Abstraction has 34345 states and 110990 transitions. [2019-12-27 19:50:08,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:50:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 34345 states and 110990 transitions. [2019-12-27 19:50:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:50:08,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:08,780 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:50:08,780 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:50:08,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:08,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1949648440, now seen corresponding path program 1 times [2019-12-27 19:50:08,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:08,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118604678] [2019-12-27 19:50:08,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:08,900 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:50:08,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118604678] [2019-12-27 19:50:08,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:08,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:50:08,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176772219] [2019-12-27 19:50:08,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:08,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:08,912 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 19:50:08,912 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:08,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:08,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:50:08,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:50:08,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:50:08,914 INFO L87 Difference]: Start difference. First operand 34345 states and 110990 transitions. Second operand 4 states. [2019-12-27 19:50:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:09,339 INFO L93 Difference]: Finished difference Result 41968 states and 135253 transitions. [2019-12-27 19:50:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:50:09,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 19:50:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:09,409 INFO L225 Difference]: With dead ends: 41968 [2019-12-27 19:50:09,409 INFO L226 Difference]: Without dead ends: 41968 [2019-12-27 19:50:09,410 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:50:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41968 states. [2019-12-27 19:50:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41968 to 37815. [2019-12-27 19:50:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37815 states. [2019-12-27 19:50:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37815 states to 37815 states and 122278 transitions. [2019-12-27 19:50:10,356 INFO L78 Accepts]: Start accepts. Automaton has 37815 states and 122278 transitions. Word has length 16 [2019-12-27 19:50:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:10,357 INFO L462 AbstractCegarLoop]: Abstraction has 37815 states and 122278 transitions. [2019-12-27 19:50:10,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:50:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 37815 states and 122278 transitions. [2019-12-27 19:50:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:50:10,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:10,366 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:50:10,366 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:50:10,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1390855021, now seen corresponding path program 1 times [2019-12-27 19:50:10,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:10,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340501610] [2019-12-27 19:50:10,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:10,459 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:50:10,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340501610] [2019-12-27 19:50:10,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:10,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:50:10,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [988095612] [2019-12-27 19:50:10,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:10,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:10,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 19:50:10,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:10,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:10,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:50:10,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:50:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:50:10,476 INFO L87 Difference]: Start difference. First operand 37815 states and 122278 transitions. Second operand 5 states. [2019-12-27 19:50:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:11,109 INFO L93 Difference]: Finished difference Result 48568 states and 154032 transitions. [2019-12-27 19:50:11,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:50:11,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 19:50:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:11,189 INFO L225 Difference]: With dead ends: 48568 [2019-12-27 19:50:11,189 INFO L226 Difference]: Without dead ends: 48561 [2019-12-27 19:50:11,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:50:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48561 states. [2019-12-27 19:50:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48561 to 37245. [2019-12-27 19:50:12,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37245 states. [2019-12-27 19:50:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37245 states to 37245 states and 120198 transitions. [2019-12-27 19:50:12,398 INFO L78 Accepts]: Start accepts. Automaton has 37245 states and 120198 transitions. Word has length 22 [2019-12-27 19:50:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:12,399 INFO L462 AbstractCegarLoop]: Abstraction has 37245 states and 120198 transitions. [2019-12-27 19:50:12,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:50:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 37245 states and 120198 transitions. [2019-12-27 19:50:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:50:12,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:12,410 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:50:12,411 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:50:12,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:12,411 INFO L82 PathProgramCache]: Analyzing trace with hash 896315521, now seen corresponding path program 1 times [2019-12-27 19:50:12,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:12,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550984647] [2019-12-27 19:50:12,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:12,463 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:50:12,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550984647] [2019-12-27 19:50:12,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:12,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:50:12,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1499242282] [2019-12-27 19:50:12,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:12,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:12,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:50:12,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:12,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:50:12,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:50:12,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:50:12,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:50:12,534 INFO L87 Difference]: Start difference. First operand 37245 states and 120198 transitions. Second operand 5 states. [2019-12-27 19:50:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:12,617 INFO L93 Difference]: Finished difference Result 14946 states and 45537 transitions. [2019-12-27 19:50:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:50:12,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:50:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:12,640 INFO L225 Difference]: With dead ends: 14946 [2019-12-27 19:50:12,640 INFO L226 Difference]: Without dead ends: 14946 [2019-12-27 19:50:12,640 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:50:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2019-12-27 19:50:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 14702. [2019-12-27 19:50:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-12-27 19:50:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 44841 transitions. [2019-12-27 19:50:12,874 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 44841 transitions. Word has length 25 [2019-12-27 19:50:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:12,874 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 44841 transitions. [2019-12-27 19:50:12,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:50:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 44841 transitions. [2019-12-27 19:50:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:50:12,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:12,884 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:50:12,885 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:50:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080207, now seen corresponding path program 1 times [2019-12-27 19:50:12,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:12,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389068450] [2019-12-27 19:50:12,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:12,935 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:50:12,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389068450] [2019-12-27 19:50:12,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:12,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:50:12,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523044323] [2019-12-27 19:50:12,936 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:12,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:12,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:50:12,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:12,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:12,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:50:12,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:50:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:50:12,949 INFO L87 Difference]: Start difference. First operand 14702 states and 44841 transitions. Second operand 3 states. [2019-12-27 19:50:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:13,066 INFO L93 Difference]: Finished difference Result 21048 states and 63094 transitions. [2019-12-27 19:50:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:50:13,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 19:50:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:13,097 INFO L225 Difference]: With dead ends: 21048 [2019-12-27 19:50:13,098 INFO L226 Difference]: Without dead ends: 21048 [2019-12-27 19:50:13,098 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:50:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21048 states. [2019-12-27 19:50:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21048 to 15496. [2019-12-27 19:50:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-12-27 19:50:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 47121 transitions. [2019-12-27 19:50:13,363 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 47121 transitions. Word has length 27 [2019-12-27 19:50:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:13,363 INFO L462 AbstractCegarLoop]: Abstraction has 15496 states and 47121 transitions. [2019-12-27 19:50:13,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:50:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 47121 transitions. [2019-12-27 19:50:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:50:13,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:13,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, 1, 1, 1, 1, 1] [2019-12-27 19:50:13,374 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:50:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:13,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1291585692, now seen corresponding path program 1 times [2019-12-27 19:50:13,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:13,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823824148] [2019-12-27 19:50:13,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:13,474 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:50:13,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823824148] [2019-12-27 19:50:13,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:13,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:50:13,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866416855] [2019-12-27 19:50:13,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:13,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:13,486 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:50:13,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:13,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:13,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:50:13,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:13,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:50:13,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:50:13,488 INFO L87 Difference]: Start difference. First operand 15496 states and 47121 transitions. Second operand 6 states. [2019-12-27 19:50:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:14,261 INFO L93 Difference]: Finished difference Result 39367 states and 118228 transitions. [2019-12-27 19:50:14,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:50:14,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 19:50:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:14,316 INFO L225 Difference]: With dead ends: 39367 [2019-12-27 19:50:14,317 INFO L226 Difference]: Without dead ends: 39367 [2019-12-27 19:50:14,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:50:14,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39367 states. [2019-12-27 19:50:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39367 to 22126. [2019-12-27 19:50:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-12-27 19:50:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 68213 transitions. [2019-12-27 19:50:15,018 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 68213 transitions. Word has length 27 [2019-12-27 19:50:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:15,019 INFO L462 AbstractCegarLoop]: Abstraction has 22126 states and 68213 transitions. [2019-12-27 19:50:15,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:50:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 68213 transitions. [2019-12-27 19:50:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 19:50:15,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:15,035 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:50:15,035 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:50:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash 859272137, now seen corresponding path program 1 times [2019-12-27 19:50:15,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:15,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976493294] [2019-12-27 19:50:15,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:15,131 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:50:15,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976493294] [2019-12-27 19:50:15,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:15,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:50:15,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866457255] [2019-12-27 19:50:15,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:15,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:15,143 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 19:50:15,143 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:15,144 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:15,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:50:15,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:50:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:50:15,145 INFO L87 Difference]: Start difference. First operand 22126 states and 68213 transitions. Second operand 6 states. [2019-12-27 19:50:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:15,958 INFO L93 Difference]: Finished difference Result 36723 states and 110142 transitions. [2019-12-27 19:50:15,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:50:15,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 19:50:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:16,014 INFO L225 Difference]: With dead ends: 36723 [2019-12-27 19:50:16,014 INFO L226 Difference]: Without dead ends: 36723 [2019-12-27 19:50:16,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:50:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36723 states. [2019-12-27 19:50:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36723 to 21684. [2019-12-27 19:50:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21684 states. [2019-12-27 19:50:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21684 states to 21684 states and 67048 transitions. [2019-12-27 19:50:16,469 INFO L78 Accepts]: Start accepts. Automaton has 21684 states and 67048 transitions. Word has length 28 [2019-12-27 19:50:16,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:16,469 INFO L462 AbstractCegarLoop]: Abstraction has 21684 states and 67048 transitions. [2019-12-27 19:50:16,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:50:16,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21684 states and 67048 transitions. [2019-12-27 19:50:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:50:16,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:16,494 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:50:16,494 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:50:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1529980999, now seen corresponding path program 1 times [2019-12-27 19:50:16,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:16,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849901593] [2019-12-27 19:50:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:16,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:50:16,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849901593] [2019-12-27 19:50:16,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:16,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:50:16,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [718428959] [2019-12-27 19:50:16,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:16,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:16,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 19:50:16,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:16,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:16,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:50:16,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:16,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:50:16,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:50:16,615 INFO L87 Difference]: Start difference. First operand 21684 states and 67048 transitions. Second operand 7 states. [2019-12-27 19:50:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:18,398 INFO L93 Difference]: Finished difference Result 48727 states and 145636 transitions. [2019-12-27 19:50:18,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 19:50:18,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 19:50:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:18,466 INFO L225 Difference]: With dead ends: 48727 [2019-12-27 19:50:18,467 INFO L226 Difference]: Without dead ends: 48727 [2019-12-27 19:50:18,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:50:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48727 states. [2019-12-27 19:50:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48727 to 23131. [2019-12-27 19:50:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23131 states. [2019-12-27 19:50:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 71461 transitions. [2019-12-27 19:50:18,976 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 71461 transitions. Word has length 33 [2019-12-27 19:50:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:18,976 INFO L462 AbstractCegarLoop]: Abstraction has 23131 states and 71461 transitions. [2019-12-27 19:50:18,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:50:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 71461 transitions. [2019-12-27 19:50:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:50:18,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:18,999 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:50:19,000 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:50:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1030046023, now seen corresponding path program 2 times [2019-12-27 19:50:19,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134436248] [2019-12-27 19:50:19,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:19,116 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:50:19,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134436248] [2019-12-27 19:50:19,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:19,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:50:19,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1578183655] [2019-12-27 19:50:19,117 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:19,123 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:19,139 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 19:50:19,139 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:19,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:50:19,178 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:50:19,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:50:19,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:19,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:50:19,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:50:19,179 INFO L87 Difference]: Start difference. First operand 23131 states and 71461 transitions. Second operand 9 states. [2019-12-27 19:50:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:22,673 INFO L93 Difference]: Finished difference Result 76694 states and 226391 transitions. [2019-12-27 19:50:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 19:50:22,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 19:50:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:22,798 INFO L225 Difference]: With dead ends: 76694 [2019-12-27 19:50:22,798 INFO L226 Difference]: Without dead ends: 76694 [2019-12-27 19:50:22,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:50:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76694 states. [2019-12-27 19:50:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76694 to 24879. [2019-12-27 19:50:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24879 states. [2019-12-27 19:50:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24879 states to 24879 states and 76747 transitions. [2019-12-27 19:50:23,550 INFO L78 Accepts]: Start accepts. Automaton has 24879 states and 76747 transitions. Word has length 33 [2019-12-27 19:50:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:23,550 INFO L462 AbstractCegarLoop]: Abstraction has 24879 states and 76747 transitions. [2019-12-27 19:50:23,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:50:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 24879 states and 76747 transitions. [2019-12-27 19:50:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:50:23,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:23,575 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:50:23,575 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:50:23,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash 2058952212, now seen corresponding path program 1 times [2019-12-27 19:50:23,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:23,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175189638] [2019-12-27 19:50:23,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:23,690 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:50:23,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175189638] [2019-12-27 19:50:23,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:23,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:50:23,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878492120] [2019-12-27 19:50:23,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:23,697 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:23,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 19:50:23,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:23,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:23,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:50:23,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:50:23,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:50:23,712 INFO L87 Difference]: Start difference. First operand 24879 states and 76747 transitions. Second operand 7 states. [2019-12-27 19:50:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:25,036 INFO L93 Difference]: Finished difference Result 45647 states and 137001 transitions. [2019-12-27 19:50:25,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 19:50:25,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 19:50:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:25,139 INFO L225 Difference]: With dead ends: 45647 [2019-12-27 19:50:25,139 INFO L226 Difference]: Without dead ends: 45647 [2019-12-27 19:50:25,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:50:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45647 states. [2019-12-27 19:50:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45647 to 23681. [2019-12-27 19:50:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23681 states. [2019-12-27 19:50:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23681 states to 23681 states and 73236 transitions. [2019-12-27 19:50:26,157 INFO L78 Accepts]: Start accepts. Automaton has 23681 states and 73236 transitions. Word has length 34 [2019-12-27 19:50:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:26,158 INFO L462 AbstractCegarLoop]: Abstraction has 23681 states and 73236 transitions. [2019-12-27 19:50:26,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:50:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 23681 states and 73236 transitions. [2019-12-27 19:50:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:50:26,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:26,177 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:50:26,177 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:50:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1960715392, now seen corresponding path program 2 times [2019-12-27 19:50:26,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:26,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376796890] [2019-12-27 19:50:26,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:26,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:50:26,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376796890] [2019-12-27 19:50:26,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:26,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:50:26,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1981341564] [2019-12-27 19:50:26,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:26,295 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:26,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 19:50:26,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:26,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:50:26,334 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:50:26,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:50:26,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:26,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:50:26,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:50:26,335 INFO L87 Difference]: Start difference. First operand 23681 states and 73236 transitions. Second operand 9 states. [2019-12-27 19:50:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:29,229 INFO L93 Difference]: Finished difference Result 55688 states and 163988 transitions. [2019-12-27 19:50:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 19:50:29,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 19:50:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:29,318 INFO L225 Difference]: With dead ends: 55688 [2019-12-27 19:50:29,318 INFO L226 Difference]: Without dead ends: 55688 [2019-12-27 19:50:29,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=356, Invalid=1204, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 19:50:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55688 states. [2019-12-27 19:50:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55688 to 21834. [2019-12-27 19:50:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21834 states. [2019-12-27 19:50:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21834 states to 21834 states and 67580 transitions. [2019-12-27 19:50:30,288 INFO L78 Accepts]: Start accepts. Automaton has 21834 states and 67580 transitions. Word has length 34 [2019-12-27 19:50:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:30,289 INFO L462 AbstractCegarLoop]: Abstraction has 21834 states and 67580 transitions. [2019-12-27 19:50:30,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:50:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 21834 states and 67580 transitions. [2019-12-27 19:50:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:50:30,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:30,316 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:50:30,317 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:50:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2104125343, now seen corresponding path program 1 times [2019-12-27 19:50:30,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:30,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638594212] [2019-12-27 19:50:30,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:30,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:50:30,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638594212] [2019-12-27 19:50:30,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:30,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:50:30,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [297374271] [2019-12-27 19:50:30,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:30,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:30,439 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 341 transitions. [2019-12-27 19:50:30,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:30,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:50:30,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:50:30,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:50:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:50:30,459 INFO L87 Difference]: Start difference. First operand 21834 states and 67580 transitions. Second operand 4 states. [2019-12-27 19:50:30,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:30,766 INFO L93 Difference]: Finished difference Result 42770 states and 132884 transitions. [2019-12-27 19:50:30,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:50:30,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 19:50:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:30,803 INFO L225 Difference]: With dead ends: 42770 [2019-12-27 19:50:30,804 INFO L226 Difference]: Without dead ends: 24117 [2019-12-27 19:50:30,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:50:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24117 states. [2019-12-27 19:50:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24117 to 20229. [2019-12-27 19:50:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20229 states. [2019-12-27 19:50:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20229 states to 20229 states and 61656 transitions. [2019-12-27 19:50:31,133 INFO L78 Accepts]: Start accepts. Automaton has 20229 states and 61656 transitions. Word has length 39 [2019-12-27 19:50:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:31,133 INFO L462 AbstractCegarLoop]: Abstraction has 20229 states and 61656 transitions. [2019-12-27 19:50:31,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:50:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 20229 states and 61656 transitions. [2019-12-27 19:50:31,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:50:31,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:31,158 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:50:31,158 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:50:31,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:31,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1014018897, now seen corresponding path program 2 times [2019-12-27 19:50:31,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:31,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079439285] [2019-12-27 19:50:31,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:31,212 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:50:31,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079439285] [2019-12-27 19:50:31,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:31,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:50:31,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1892498905] [2019-12-27 19:50:31,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:31,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:31,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 341 transitions. [2019-12-27 19:50:31,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:31,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:31,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:50:31,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:31,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:50:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:50:31,285 INFO L87 Difference]: Start difference. First operand 20229 states and 61656 transitions. Second operand 3 states. [2019-12-27 19:50:31,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:31,369 INFO L93 Difference]: Finished difference Result 20228 states and 61654 transitions. [2019-12-27 19:50:31,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:50:31,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 19:50:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:31,402 INFO L225 Difference]: With dead ends: 20228 [2019-12-27 19:50:31,402 INFO L226 Difference]: Without dead ends: 20228 [2019-12-27 19:50:31,402 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:50:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20228 states. [2019-12-27 19:50:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20228 to 20228. [2019-12-27 19:50:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20228 states. [2019-12-27 19:50:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20228 states to 20228 states and 61654 transitions. [2019-12-27 19:50:31,705 INFO L78 Accepts]: Start accepts. Automaton has 20228 states and 61654 transitions. Word has length 39 [2019-12-27 19:50:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:31,705 INFO L462 AbstractCegarLoop]: Abstraction has 20228 states and 61654 transitions. [2019-12-27 19:50:31,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:50:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 20228 states and 61654 transitions. [2019-12-27 19:50:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:50:31,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:31,725 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:50:31,725 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:50:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1415326004, now seen corresponding path program 1 times [2019-12-27 19:50:31,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:31,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750056808] [2019-12-27 19:50:31,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:31,808 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:50:31,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750056808] [2019-12-27 19:50:31,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:31,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:50:31,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290077953] [2019-12-27 19:50:31,809 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:31,817 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:32,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 413 transitions. [2019-12-27 19:50:32,160 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:32,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 19:50:32,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:50:32,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:50:32,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:50:32,548 INFO L87 Difference]: Start difference. First operand 20228 states and 61654 transitions. Second operand 15 states. [2019-12-27 19:50:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:36,159 INFO L93 Difference]: Finished difference Result 56824 states and 169577 transitions. [2019-12-27 19:50:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 19:50:36,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-12-27 19:50:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:36,248 INFO L225 Difference]: With dead ends: 56824 [2019-12-27 19:50:36,248 INFO L226 Difference]: Without dead ends: 56824 [2019-12-27 19:50:36,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:50:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56824 states. [2019-12-27 19:50:36,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56824 to 25877. [2019-12-27 19:50:36,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25877 states. [2019-12-27 19:50:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25877 states to 25877 states and 78284 transitions. [2019-12-27 19:50:36,898 INFO L78 Accepts]: Start accepts. Automaton has 25877 states and 78284 transitions. Word has length 40 [2019-12-27 19:50:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:36,898 INFO L462 AbstractCegarLoop]: Abstraction has 25877 states and 78284 transitions. [2019-12-27 19:50:36,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:50:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25877 states and 78284 transitions. [2019-12-27 19:50:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 19:50:36,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:36,925 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:50:36,925 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:50:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1542628910, now seen corresponding path program 2 times [2019-12-27 19:50:36,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:36,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207609866] [2019-12-27 19:50:36,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:36,982 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:50:36,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207609866] [2019-12-27 19:50:36,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:36,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:50:36,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150995130] [2019-12-27 19:50:36,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:36,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:37,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 368 transitions. [2019-12-27 19:50:37,073 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:37,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:50:37,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:50:37,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:37,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:50:37,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:50:37,110 INFO L87 Difference]: Start difference. First operand 25877 states and 78284 transitions. Second operand 7 states. [2019-12-27 19:50:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:37,515 INFO L93 Difference]: Finished difference Result 24450 states and 74928 transitions. [2019-12-27 19:50:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:50:37,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 19:50:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:37,549 INFO L225 Difference]: With dead ends: 24450 [2019-12-27 19:50:37,549 INFO L226 Difference]: Without dead ends: 22708 [2019-12-27 19:50:37,549 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:50:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22708 states. [2019-12-27 19:50:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22708 to 21504. [2019-12-27 19:50:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21504 states. [2019-12-27 19:50:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21504 states to 21504 states and 67284 transitions. [2019-12-27 19:50:37,909 INFO L78 Accepts]: Start accepts. Automaton has 21504 states and 67284 transitions. Word has length 40 [2019-12-27 19:50:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:37,909 INFO L462 AbstractCegarLoop]: Abstraction has 21504 states and 67284 transitions. [2019-12-27 19:50:37,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:50:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21504 states and 67284 transitions. [2019-12-27 19:50:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:50:37,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:37,938 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:50:37,938 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:50:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash -910052422, now seen corresponding path program 1 times [2019-12-27 19:50:37,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:37,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770281560] [2019-12-27 19:50:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:38,036 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:50:38,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770281560] [2019-12-27 19:50:38,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:38,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:50:38,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1079320947] [2019-12-27 19:50:38,037 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:38,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:38,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 219 transitions. [2019-12-27 19:50:38,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:38,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:50:38,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:50:38,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:38,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:50:38,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:50:38,270 INFO L87 Difference]: Start difference. First operand 21504 states and 67284 transitions. Second operand 8 states. [2019-12-27 19:50:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:38,965 INFO L93 Difference]: Finished difference Result 69576 states and 214335 transitions. [2019-12-27 19:50:38,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:50:38,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 19:50:38,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:39,042 INFO L225 Difference]: With dead ends: 69576 [2019-12-27 19:50:39,042 INFO L226 Difference]: Without dead ends: 48966 [2019-12-27 19:50:39,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:50:39,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48966 states. [2019-12-27 19:50:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48966 to 24748. [2019-12-27 19:50:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24748 states. [2019-12-27 19:50:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24748 states to 24748 states and 77432 transitions. [2019-12-27 19:50:39,639 INFO L78 Accepts]: Start accepts. Automaton has 24748 states and 77432 transitions. Word has length 64 [2019-12-27 19:50:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:39,639 INFO L462 AbstractCegarLoop]: Abstraction has 24748 states and 77432 transitions. [2019-12-27 19:50:39,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:50:39,639 INFO L276 IsEmpty]: Start isEmpty. Operand 24748 states and 77432 transitions. [2019-12-27 19:50:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:50:39,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:39,669 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:50:39,669 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:50:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1480379210, now seen corresponding path program 2 times [2019-12-27 19:50:39,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:39,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902433376] [2019-12-27 19:50:39,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:40,028 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-27 19:50:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:50:40,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902433376] [2019-12-27 19:50:40,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:40,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:50:40,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836389010] [2019-12-27 19:50:40,060 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:40,110 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:40,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 240 transitions. [2019-12-27 19:50:40,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:40,357 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 19:50:40,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:50:40,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:50:40,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:50:40,358 INFO L87 Difference]: Start difference. First operand 24748 states and 77432 transitions. Second operand 11 states. [2019-12-27 19:50:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:43,296 INFO L93 Difference]: Finished difference Result 218911 states and 668352 transitions. [2019-12-27 19:50:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 19:50:43,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 19:50:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:43,519 INFO L225 Difference]: With dead ends: 218911 [2019-12-27 19:50:43,519 INFO L226 Difference]: Without dead ends: 142967 [2019-12-27 19:50:43,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=676, Invalid=2294, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 19:50:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142967 states. [2019-12-27 19:50:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142967 to 35115. [2019-12-27 19:50:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35115 states. [2019-12-27 19:50:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35115 states to 35115 states and 109520 transitions. [2019-12-27 19:50:45,468 INFO L78 Accepts]: Start accepts. Automaton has 35115 states and 109520 transitions. Word has length 64 [2019-12-27 19:50:45,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:45,468 INFO L462 AbstractCegarLoop]: Abstraction has 35115 states and 109520 transitions. [2019-12-27 19:50:45,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:50:45,468 INFO L276 IsEmpty]: Start isEmpty. Operand 35115 states and 109520 transitions. [2019-12-27 19:50:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:50:45,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:45,511 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:50:45,512 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:50:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1983744100, now seen corresponding path program 3 times [2019-12-27 19:50:45,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:45,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673823853] [2019-12-27 19:50:45,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:50:45,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673823853] [2019-12-27 19:50:45,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:45,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 19:50:45,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344723061] [2019-12-27 19:50:45,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:45,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:45,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 325 transitions. [2019-12-27 19:50:45,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:45,927 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 19:50:45,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:50:45,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:50:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:50:45,929 INFO L87 Difference]: Start difference. First operand 35115 states and 109520 transitions. Second operand 12 states. [2019-12-27 19:50:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:48,307 INFO L93 Difference]: Finished difference Result 87909 states and 268447 transitions. [2019-12-27 19:50:48,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:50:48,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 19:50:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:48,416 INFO L225 Difference]: With dead ends: 87909 [2019-12-27 19:50:48,416 INFO L226 Difference]: Without dead ends: 76132 [2019-12-27 19:50:48,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:50:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76132 states. [2019-12-27 19:50:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76132 to 35011. [2019-12-27 19:50:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35011 states. [2019-12-27 19:50:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35011 states to 35011 states and 109197 transitions. [2019-12-27 19:50:49,275 INFO L78 Accepts]: Start accepts. Automaton has 35011 states and 109197 transitions. Word has length 64 [2019-12-27 19:50:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:49,276 INFO L462 AbstractCegarLoop]: Abstraction has 35011 states and 109197 transitions. [2019-12-27 19:50:49,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:50:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 35011 states and 109197 transitions. [2019-12-27 19:50:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 19:50:49,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:49,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:50:49,317 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:50:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:49,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1629126138, now seen corresponding path program 4 times [2019-12-27 19:50:49,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:49,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808894962] [2019-12-27 19:50:49,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:49,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:50:49,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808894962] [2019-12-27 19:50:49,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:49,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:50:49,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1602131823] [2019-12-27 19:50:49,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:49,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:49,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 145 states and 213 transitions. [2019-12-27 19:50:49,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:49,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:50:49,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:50:49,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:49,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:50:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:50:49,537 INFO L87 Difference]: Start difference. First operand 35011 states and 109197 transitions. Second operand 3 states. [2019-12-27 19:50:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:49,718 INFO L93 Difference]: Finished difference Result 40472 states and 125362 transitions. [2019-12-27 19:50:49,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:50:49,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 19:50:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:49,778 INFO L225 Difference]: With dead ends: 40472 [2019-12-27 19:50:49,778 INFO L226 Difference]: Without dead ends: 40472 [2019-12-27 19:50:49,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:50:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40472 states. [2019-12-27 19:50:50,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40472 to 35959. [2019-12-27 19:50:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35959 states. [2019-12-27 19:50:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35959 states to 35959 states and 112192 transitions. [2019-12-27 19:50:50,732 INFO L78 Accepts]: Start accepts. Automaton has 35959 states and 112192 transitions. Word has length 64 [2019-12-27 19:50:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:50,732 INFO L462 AbstractCegarLoop]: Abstraction has 35959 states and 112192 transitions. [2019-12-27 19:50:50,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:50:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 35959 states and 112192 transitions. [2019-12-27 19:50:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:50:50,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:50,773 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:50:50,773 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:50:50,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:50,774 INFO L82 PathProgramCache]: Analyzing trace with hash -748238597, now seen corresponding path program 1 times [2019-12-27 19:50:50,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:50,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845098797] [2019-12-27 19:50:50,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:50,826 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:50:50,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845098797] [2019-12-27 19:50:50,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:50,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:50:50,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019031472] [2019-12-27 19:50:50,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:50,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:51,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 247 transitions. [2019-12-27 19:50:51,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:51,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:50:51,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:50:51,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:50:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:50:51,111 INFO L87 Difference]: Start difference. First operand 35959 states and 112192 transitions. Second operand 6 states. [2019-12-27 19:50:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:50:52,003 INFO L93 Difference]: Finished difference Result 59862 states and 185076 transitions. [2019-12-27 19:50:52,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:50:52,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 19:50:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:50:52,095 INFO L225 Difference]: With dead ends: 59862 [2019-12-27 19:50:52,095 INFO L226 Difference]: Without dead ends: 59862 [2019-12-27 19:50:52,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:50:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59862 states. [2019-12-27 19:50:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59862 to 37882. [2019-12-27 19:50:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37882 states. [2019-12-27 19:50:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37882 states to 37882 states and 118774 transitions. [2019-12-27 19:50:52,910 INFO L78 Accepts]: Start accepts. Automaton has 37882 states and 118774 transitions. Word has length 65 [2019-12-27 19:50:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:50:52,910 INFO L462 AbstractCegarLoop]: Abstraction has 37882 states and 118774 transitions. [2019-12-27 19:50:52,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:50:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 37882 states and 118774 transitions. [2019-12-27 19:50:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:50:52,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:50:52,955 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:50:52,955 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:50:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:50:52,955 INFO L82 PathProgramCache]: Analyzing trace with hash -232484785, now seen corresponding path program 2 times [2019-12-27 19:50:52,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:50:52,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007290051] [2019-12-27 19:50:52,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:50:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:50:53,361 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:50:53,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007290051] [2019-12-27 19:50:53,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:50:53,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:50:53,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1538791785] [2019-12-27 19:50:53,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:50:53,384 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:50:53,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 445 transitions. [2019-12-27 19:50:53,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:50:53,894 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:50:53,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:50:53,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:50:53,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:50:53,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:50:53,895 INFO L87 Difference]: Start difference. First operand 37882 states and 118774 transitions. Second operand 13 states. [2019-12-27 19:50:55,410 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 19:50:55,637 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 19:50:58,829 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 19:50:58,986 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 19:50:59,398 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 19:50:59,586 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 19:50:59,835 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 19:50:59,962 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-27 19:51:01,648 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 19:51:02,768 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 19:51:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:51:05,515 INFO L93 Difference]: Finished difference Result 146799 states and 445301 transitions. [2019-12-27 19:51:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-27 19:51:05,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 19:51:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:51:05,734 INFO L225 Difference]: With dead ends: 146799 [2019-12-27 19:51:05,734 INFO L226 Difference]: Without dead ends: 136001 [2019-12-27 19:51:05,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3716 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1653, Invalid=8049, Unknown=0, NotChecked=0, Total=9702 [2019-12-27 19:51:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136001 states. [2019-12-27 19:51:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136001 to 38670. [2019-12-27 19:51:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38670 states. [2019-12-27 19:51:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38670 states to 38670 states and 121636 transitions. [2019-12-27 19:51:07,774 INFO L78 Accepts]: Start accepts. Automaton has 38670 states and 121636 transitions. Word has length 65 [2019-12-27 19:51:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:51:07,775 INFO L462 AbstractCegarLoop]: Abstraction has 38670 states and 121636 transitions. [2019-12-27 19:51:07,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:51:07,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38670 states and 121636 transitions. [2019-12-27 19:51:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:51:07,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:51:07,821 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:51:07,821 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:51:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:51:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash -605396795, now seen corresponding path program 3 times [2019-12-27 19:51:07,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:51:07,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757656573] [2019-12-27 19:51:07,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:51:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:51:07,958 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:51:07,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757656573] [2019-12-27 19:51:07,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:51:07,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:51:07,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1783359143] [2019-12-27 19:51:07,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:51:07,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:51:08,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 260 states and 474 transitions. [2019-12-27 19:51:08,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:51:08,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:51:08,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:51:08,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:51:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:51:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:51:08,731 INFO L87 Difference]: Start difference. First operand 38670 states and 121636 transitions. Second operand 13 states. [2019-12-27 19:51:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:51:15,758 INFO L93 Difference]: Finished difference Result 258347 states and 788642 transitions. [2019-12-27 19:51:15,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-27 19:51:15,758 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 19:51:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:51:16,106 INFO L225 Difference]: With dead ends: 258347 [2019-12-27 19:51:16,106 INFO L226 Difference]: Without dead ends: 204889 [2019-12-27 19:51:16,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 6 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1543, Invalid=7199, Unknown=0, NotChecked=0, Total=8742 [2019-12-27 19:51:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204889 states. [2019-12-27 19:51:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204889 to 40546. [2019-12-27 19:51:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40546 states. [2019-12-27 19:51:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40546 states to 40546 states and 127439 transitions. [2019-12-27 19:51:18,713 INFO L78 Accepts]: Start accepts. Automaton has 40546 states and 127439 transitions. Word has length 65 [2019-12-27 19:51:18,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:51:18,713 INFO L462 AbstractCegarLoop]: Abstraction has 40546 states and 127439 transitions. [2019-12-27 19:51:18,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:51:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 40546 states and 127439 transitions. [2019-12-27 19:51:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:51:18,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:51:18,761 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:51:18,762 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:51:18,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:51:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1601587072, now seen corresponding path program 1 times [2019-12-27 19:51:18,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:51:18,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824649313] [2019-12-27 19:51:18,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:51:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:51:18,921 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:51:18,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824649313] [2019-12-27 19:51:18,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:51:18,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 19:51:18,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829986306] [2019-12-27 19:51:18,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:51:18,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:51:19,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 364 transitions. [2019-12-27 19:51:19,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:51:19,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:51:19,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:51:19,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:51:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:51:19,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:51:19,185 INFO L87 Difference]: Start difference. First operand 40546 states and 127439 transitions. Second operand 9 states. [2019-12-27 19:51:22,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:51:22,761 INFO L93 Difference]: Finished difference Result 99031 states and 302597 transitions. [2019-12-27 19:51:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 19:51:22,762 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 19:51:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:51:22,924 INFO L225 Difference]: With dead ends: 99031 [2019-12-27 19:51:22,925 INFO L226 Difference]: Without dead ends: 99031 [2019-12-27 19:51:22,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 19:51:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99031 states. [2019-12-27 19:51:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99031 to 43813. [2019-12-27 19:51:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43813 states. [2019-12-27 19:51:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43813 states to 43813 states and 138392 transitions. [2019-12-27 19:51:24,482 INFO L78 Accepts]: Start accepts. Automaton has 43813 states and 138392 transitions. Word has length 65 [2019-12-27 19:51:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:51:24,482 INFO L462 AbstractCegarLoop]: Abstraction has 43813 states and 138392 transitions. [2019-12-27 19:51:24,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:51:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 43813 states and 138392 transitions. [2019-12-27 19:51:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 19:51:24,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:51:24,533 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:51:24,533 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:51:24,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:51:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2080466144, now seen corresponding path program 2 times [2019-12-27 19:51:24,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:51:24,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469566562] [2019-12-27 19:51:24,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:51:24,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:51:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:51:24,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469566562] [2019-12-27 19:51:24,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:51:24,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:51:24,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711435939] [2019-12-27 19:51:24,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:51:24,610 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:51:24,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 218 transitions. [2019-12-27 19:51:24,808 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:51:24,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:51:24,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:51:24,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:51:24,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:51:24,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:51:24,810 INFO L87 Difference]: Start difference. First operand 43813 states and 138392 transitions. Second operand 3 states. [2019-12-27 19:51:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:51:24,973 INFO L93 Difference]: Finished difference Result 43813 states and 138391 transitions. [2019-12-27 19:51:24,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:51:24,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 19:51:24,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:51:25,040 INFO L225 Difference]: With dead ends: 43813 [2019-12-27 19:51:25,040 INFO L226 Difference]: Without dead ends: 43813 [2019-12-27 19:51:25,041 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:51:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43813 states. [2019-12-27 19:51:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43813 to 35093. [2019-12-27 19:51:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35093 states. [2019-12-27 19:51:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35093 states to 35093 states and 112202 transitions. [2019-12-27 19:51:25,688 INFO L78 Accepts]: Start accepts. Automaton has 35093 states and 112202 transitions. Word has length 65 [2019-12-27 19:51:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:51:25,688 INFO L462 AbstractCegarLoop]: Abstraction has 35093 states and 112202 transitions. [2019-12-27 19:51:25,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:51:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 35093 states and 112202 transitions. [2019-12-27 19:51:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 19:51:25,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:51:25,734 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:51:25,734 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:51:25,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:51:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash 241793892, now seen corresponding path program 1 times [2019-12-27 19:51:25,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:51:25,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640415697] [2019-12-27 19:51:25,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:51:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:51:25,795 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:51:25,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640415697] [2019-12-27 19:51:25,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:51:25,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:51:25,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1758852560] [2019-12-27 19:51:25,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:51:25,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:51:26,171 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 199 transitions. [2019-12-27 19:51:26,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:51:26,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:51:26,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:51:26,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:51:26,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:51:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:51:26,173 INFO L87 Difference]: Start difference. First operand 35093 states and 112202 transitions. Second operand 3 states. [2019-12-27 19:51:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:51:26,263 INFO L93 Difference]: Finished difference Result 26827 states and 85231 transitions. [2019-12-27 19:51:26,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:51:26,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 19:51:26,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:51:26,301 INFO L225 Difference]: With dead ends: 26827 [2019-12-27 19:51:26,301 INFO L226 Difference]: Without dead ends: 26827 [2019-12-27 19:51:26,302 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:51:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26827 states. [2019-12-27 19:51:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26827 to 24083. [2019-12-27 19:51:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24083 states. [2019-12-27 19:51:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24083 states to 24083 states and 76342 transitions. [2019-12-27 19:51:26,674 INFO L78 Accepts]: Start accepts. Automaton has 24083 states and 76342 transitions. Word has length 66 [2019-12-27 19:51:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:51:26,674 INFO L462 AbstractCegarLoop]: Abstraction has 24083 states and 76342 transitions. [2019-12-27 19:51:26,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:51:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 24083 states and 76342 transitions. [2019-12-27 19:51:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 19:51:26,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:51:26,701 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:51:26,701 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:51:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:51:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash -190644257, now seen corresponding path program 1 times [2019-12-27 19:51:26,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:51:26,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593170507] [2019-12-27 19:51:26,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:51:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:51:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:51:26,812 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:51:26,812 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:51:26,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_25) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= v_~z~0_28 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_19|) |v_ULTIMATE.start_main_~#t159~0.offset_15| 0)) |v_#memory_int_19|) (= v_~z$r_buff0_thd2~0_20 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t159~0.base_19|) (= 0 v_~z$r_buff1_thd2~0_16) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t159~0.base_19| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd1~0_27 0) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~z$w_buff1_used~0_74) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t159~0.base_19| 1)) (= v_~z$w_buff0_used~0_111 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t159~0.base_19|)) (= 0 v_~z$r_buff1_thd1~0_19) (= |v_ULTIMATE.start_main_~#t159~0.offset_15| 0) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_24) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_15|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ULTIMATE.start_main_~#t159~0.base=|v_ULTIMATE.start_main_~#t159~0.base_19|, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_18|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~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_76, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_18, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~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_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t159~0.offset=|v_ULTIMATE.start_main_~#t159~0.offset_15|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, ~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_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t159~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t160~0.base, ~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_~#t161~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~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_#res, #valid, #memory_int, ULTIMATE.start_main_~#t159~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:51:26,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L830-1-->L832: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11|) |v_ULTIMATE.start_main_~#t160~0.offset_9| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t160~0.base_11| 0)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t160~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t160~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t160~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_11|, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t160~0.base, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 19:51:26,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd1~0_17 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_18 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-27 19:51:26,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-457328417 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-457328417 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-457328417 |P1Thread1of1ForFork2_#t~ite9_Out-457328417|)) (and (not .cse1) (= ~z$w_buff1~0_In-457328417 |P1Thread1of1ForFork2_#t~ite9_Out-457328417|) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-457328417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-457328417, ~z$w_buff1~0=~z$w_buff1~0_In-457328417, ~z~0=~z~0_In-457328417} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-457328417|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-457328417, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-457328417, ~z$w_buff1~0=~z$w_buff1~0_In-457328417, ~z~0=~z~0_In-457328417} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 19:51:26,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= v_~z~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 19:51:26,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1068324950 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1068324950 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1068324950| ~z$w_buff0_used~0_In1068324950)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1068324950|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1068324950, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1068324950} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1068324950, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1068324950|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1068324950} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 19:51:26,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1983509200 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1983509200 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1983509200 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1983509200 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1983509200| ~z$w_buff1_used~0_In1983509200) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out1983509200| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1983509200, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1983509200, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1983509200, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1983509200} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1983509200, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1983509200, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1983509200, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1983509200|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1983509200} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 19:51:26,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9|) |v_ULTIMATE.start_main_~#t161~0.offset_8| 2))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t161~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t161~0.base_9|) (= |v_ULTIMATE.start_main_~#t161~0.offset_8| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9| 1) |v_#valid_27|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t161~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t161~0.base, #length] because there is no mapped edge [2019-12-27 19:51:26,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L796-->L796-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-321020768 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out-321020768| |P2Thread1of1ForFork0_#t~ite21_Out-321020768|) (= |P2Thread1of1ForFork0_#t~ite20_Out-321020768| ~z$w_buff0~0_In-321020768) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-321020768 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-321020768 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-321020768 256)) .cse0) (and (= (mod ~z$r_buff1_thd3~0_In-321020768 256) 0) .cse0))) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite20_In-321020768| |P2Thread1of1ForFork0_#t~ite20_Out-321020768|) (= ~z$w_buff0~0_In-321020768 |P2Thread1of1ForFork0_#t~ite21_Out-321020768|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-321020768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-321020768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-321020768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-321020768, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-321020768|, ~weak$$choice2~0=~weak$$choice2~0_In-321020768} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-321020768|, ~z$w_buff0~0=~z$w_buff0~0_In-321020768, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-321020768, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-321020768, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-321020768, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-321020768, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-321020768|, ~weak$$choice2~0=~weak$$choice2~0_In-321020768} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 19:51:26,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1714178568 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1714178568 |P2Thread1of1ForFork0_#t~ite24_Out-1714178568|) (= |P2Thread1of1ForFork0_#t~ite23_In-1714178568| |P2Thread1of1ForFork0_#t~ite23_Out-1714178568|)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1714178568| |P2Thread1of1ForFork0_#t~ite23_Out-1714178568|) .cse0 (= ~z$w_buff1~0_In-1714178568 |P2Thread1of1ForFork0_#t~ite23_Out-1714178568|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1714178568 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1714178568 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1714178568 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1714178568 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1714178568, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1714178568, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1714178568|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714178568, ~z$w_buff1~0=~z$w_buff1~0_In-1714178568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1714178568, ~weak$$choice2~0=~weak$$choice2~0_In-1714178568} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1714178568, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1714178568|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1714178568, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1714178568|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714178568, ~z$w_buff1~0=~z$w_buff1~0_In-1714178568, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1714178568, ~weak$$choice2~0=~weak$$choice2~0_In-1714178568} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 19:51:26,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1746067583 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_Out1746067583| |P2Thread1of1ForFork0_#t~ite27_Out1746067583|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1746067583 256) 0))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1746067583 256))) (= (mod ~z$w_buff0_used~0_In1746067583 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1746067583 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite26_Out1746067583| ~z$w_buff0_used~0_In1746067583)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out1746067583| ~z$w_buff0_used~0_In1746067583) (= |P2Thread1of1ForFork0_#t~ite26_In1746067583| |P2Thread1of1ForFork0_#t~ite26_Out1746067583|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1746067583|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1746067583, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1746067583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1746067583, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1746067583, ~weak$$choice2~0=~weak$$choice2~0_In1746067583} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1746067583|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1746067583|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1746067583, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1746067583, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1746067583, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1746067583, ~weak$$choice2~0=~weak$$choice2~0_In1746067583} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 19:51:26,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff0_thd3~0_48)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_16} 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_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} 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:51:26,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: 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:51:26,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1523200072 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1523200072 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1523200072| ~z~0_In1523200072) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1523200072| ~z$w_buff1~0_In1523200072)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1523200072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1523200072, ~z$w_buff1~0=~z$w_buff1~0_In1523200072, ~z~0=~z~0_In1523200072} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1523200072|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1523200072, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1523200072, ~z$w_buff1~0=~z$w_buff1~0_In1523200072, ~z~0=~z~0_In1523200072} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 19:51:26,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_17 |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_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 19:51:26,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1355231797 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1355231797 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1355231797|)) (and (= ~z$w_buff0_used~0_In1355231797 |P2Thread1of1ForFork0_#t~ite40_Out1355231797|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1355231797, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1355231797} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1355231797, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1355231797|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1355231797} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 19:51:26,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In176752721 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In176752721 256)))) (or (and (= ~z$r_buff0_thd2~0_In176752721 |P1Thread1of1ForFork2_#t~ite13_Out176752721|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out176752721| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In176752721, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In176752721} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In176752721, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out176752721|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In176752721} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 19:51:26,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In356232439 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In356232439 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In356232439 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In356232439 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out356232439|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In356232439 |P1Thread1of1ForFork2_#t~ite14_Out356232439|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In356232439, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In356232439, ~z$w_buff1_used~0=~z$w_buff1_used~0_In356232439, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In356232439} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In356232439, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In356232439, ~z$w_buff1_used~0=~z$w_buff1_used~0_In356232439, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out356232439|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In356232439} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 19:51:26,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L775-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, 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_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, 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:51:26,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1114573364 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1114573364 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1114573364| ~z$w_buff0_used~0_In-1114573364)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1114573364| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1114573364} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1114573364|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1114573364, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1114573364} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 19:51:26,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In2080764905 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2080764905 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In2080764905 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In2080764905 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out2080764905| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In2080764905 |P0Thread1of1ForFork1_#t~ite6_Out2080764905|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2080764905, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2080764905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2080764905, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2080764905} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2080764905, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2080764905|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2080764905, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2080764905, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2080764905} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 19:51:26,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1138249556 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1138249556 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out1138249556 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out1138249556 ~z$r_buff0_thd1~0_In1138249556)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1138249556} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1138249556, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1138249556|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1138249556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:51:26,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In352314653 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In352314653 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In352314653 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In352314653 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out352314653| ~z$r_buff1_thd1~0_In352314653) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out352314653| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In352314653, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In352314653, ~z$w_buff1_used~0=~z$w_buff1_used~0_In352314653, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In352314653} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out352314653|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In352314653, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In352314653, ~z$w_buff1_used~0=~z$w_buff1_used~0_In352314653, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In352314653} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 19:51:26,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_16 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} 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_16, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} 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:51:26,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-24964262 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-24964262 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-24964262 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-24964262 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-24964262|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-24964262 |P2Thread1of1ForFork0_#t~ite41_Out-24964262|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24964262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-24964262, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-24964262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-24964262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-24964262, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-24964262|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 19:51:26,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1145677599 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1145677599 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1145677599| ~z$r_buff0_thd3~0_In-1145677599) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1145677599| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1145677599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1145677599} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1145677599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1145677599, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1145677599|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:51:26,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1922287713 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1922287713 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1922287713 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1922287713 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1922287713 |P2Thread1of1ForFork0_#t~ite43_Out-1922287713|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out-1922287713| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1922287713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1922287713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1922287713} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1922287713|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922287713, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1922287713, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1922287713, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1922287713} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 19:51:26,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} 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_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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:51:26,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: 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_3|, ~__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:51:26,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-886889052 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-886889052 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-886889052| |ULTIMATE.start_main_#t~ite47_Out-886889052|))) (or (and (= ~z~0_In-886889052 |ULTIMATE.start_main_#t~ite47_Out-886889052|) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In-886889052 |ULTIMATE.start_main_#t~ite47_Out-886889052|) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-886889052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886889052, ~z$w_buff1~0=~z$w_buff1~0_In-886889052, ~z~0=~z~0_In-886889052} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-886889052, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-886889052|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886889052, ~z$w_buff1~0=~z$w_buff1~0_In-886889052, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-886889052|, ~z~0=~z~0_In-886889052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 19:51:26,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In473971681 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In473971681 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In473971681 |ULTIMATE.start_main_#t~ite49_Out473971681|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out473971681| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In473971681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In473971681} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In473971681, ~z$w_buff0_used~0=~z$w_buff0_used~0_In473971681, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out473971681|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 19:51:26,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In73987988 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In73987988 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In73987988 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In73987988 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out73987988|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In73987988 |ULTIMATE.start_main_#t~ite50_Out73987988|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In73987988, ~z$w_buff0_used~0=~z$w_buff0_used~0_In73987988, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In73987988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In73987988} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out73987988|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In73987988, ~z$w_buff0_used~0=~z$w_buff0_used~0_In73987988, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In73987988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In73987988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 19:51:26,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In594780166 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In594780166 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In594780166 |ULTIMATE.start_main_#t~ite51_Out594780166|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out594780166| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In594780166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In594780166} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In594780166, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out594780166|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In594780166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 19:51:26,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1853646263 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1853646263 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1853646263 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1853646263 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1853646263| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite52_Out1853646263| ~z$r_buff1_thd0~0_In1853646263) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1853646263, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1853646263, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1853646263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853646263} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1853646263|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1853646263, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1853646263, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1853646263, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853646263} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 19:51:26,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256)) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} 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:51:26,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:51:26 BasicIcfg [2019-12-27 19:51:26,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:51:26,928 INFO L168 Benchmark]: Toolchain (without parser) took 143872.80 ms. Allocated memory was 145.2 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 102.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:51:26,928 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 19:51:26,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.91 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:51:26,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.13 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 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:51:26,930 INFO L168 Benchmark]: Boogie Preprocessor took 37.99 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.5 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:51:26,930 INFO L168 Benchmark]: RCFGBuilder took 972.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 101.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:51:26,931 INFO L168 Benchmark]: TraceAbstraction took 142035.41 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 19:51:26,934 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.26 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.91 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.13 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.99 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 972.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 101.2 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 142035.41 ms. Allocated memory was 202.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 95 ProgramPointsAfterwards, 214 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7246 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82443 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t159, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L832] FCALL, FORK 0 pthread_create(&t160, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, 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] [L771] 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_p1_EAX=2, __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=2, 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] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t161, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=11, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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_p1_EAX=2, __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=11, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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) [L796] 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)) [L797] 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)) [L798] 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)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=11, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 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)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=11, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=11, weak$$choice2=7, x=2, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=11, weak$$choice2=7, x=2, 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=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 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 [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=11, weak$$choice2=7, x=2, 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=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 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) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 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 [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 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_p1_EAX=2, __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=11, weak$$choice2=7, x=2, y=1, z=1, 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] [L840] 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) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 141.7s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 57.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7232 SDtfs, 14847 SDslu, 24471 SDs, 0 SdLazy, 20661 SolverSat, 1007 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 690 GetRequests, 136 SyntacticMatches, 52 SemanticMatches, 502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9471 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158867occurred 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, 27 MinimizatonAttempts, 765373 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1178 NumberOfCodeBlocks, 1178 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 160071 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...