/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:17:29,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:17:29,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:17:29,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:17:29,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:17:29,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:17:29,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:17:29,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:17:29,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:17:29,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:17:29,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:17:29,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:17:29,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:17:29,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:17:29,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:17:29,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:17:29,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:17:29,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:17:29,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:17:29,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:17:29,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:17:29,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:17:29,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:17:29,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:17:29,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:17:29,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:17:29,875 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:17:29,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:17:29,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:17:29,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:17:29,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:17:29,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:17:29,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:17:29,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:17:29,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:17:29,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:17:29,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:17:29,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:17:29,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:17:29,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:17:29,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:17:29,885 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-NoLbe-MCR.epf [2019-12-28 02:17:29,899 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:17:29,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:17:29,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:17:29,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:17:29,901 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:17:29,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:17:29,902 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:17:29,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:17:29,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:17:29,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:17:29,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:17:29,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:17:29,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:17:29,903 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:17:29,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:17:29,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:17:29,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:17:29,904 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:17:29,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:17:29,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:17:29,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:17:29,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:17:29,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:17:29,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:17:29,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:17:29,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:17:29,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:17:29,905 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:17:29,906 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:17:29,906 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:17:29,906 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:17:29,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:17:30,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:17:30,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:17:30,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:17:30,221 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:17:30,223 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:17:30,225 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.opt.i [2019-12-28 02:17:30,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b6883d9/4e7e863ec75e43bb80fea9f815f7d3b3/FLAG05bceba50 [2019-12-28 02:17:30,860 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:17:30,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.opt.i [2019-12-28 02:17:30,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b6883d9/4e7e863ec75e43bb80fea9f815f7d3b3/FLAG05bceba50 [2019-12-28 02:17:31,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b6883d9/4e7e863ec75e43bb80fea9f815f7d3b3 [2019-12-28 02:17:31,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:17:31,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:17:31,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:17:31,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:17:31,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:17:31,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:31,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30cea659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31, skipping insertion in model container [2019-12-28 02:17:31,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:31,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:17:31,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:17:31,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:17:31,767 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:17:31,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:17:31,903 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:17:31,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31 WrapperNode [2019-12-28 02:17:31,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:17:31,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:17:31,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:17:31,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:17:31,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:31,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:31,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:17:31,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:17:31,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:17:31,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:17:31,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:31,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:31,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:31,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:32,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:32,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:32,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (1/1) ... [2019-12-28 02:17:32,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:17:32,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:17:32,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:17:32,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:17:32,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (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-28 02:17:32,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:17:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:17:32,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:17:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:17:32,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:17:32,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:17:32,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:17:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:17:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 02:17:32,094 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 02:17:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:17:32,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:17:32,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:17:32,098 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 02:17:32,756 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:17:32,757 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:17:32,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:17:32 BoogieIcfgContainer [2019-12-28 02:17:32,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:17:32,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:17:32,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:17:32,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:17:32,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:17:31" (1/3) ... [2019-12-28 02:17:32,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643efd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:17:32, skipping insertion in model container [2019-12-28 02:17:32,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:17:31" (2/3) ... [2019-12-28 02:17:32,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643efd2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:17:32, skipping insertion in model container [2019-12-28 02:17:32,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:17:32" (3/3) ... [2019-12-28 02:17:32,767 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_power.opt.i [2019-12-28 02:17:32,777 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:17:32,778 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:17:32,785 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:17:32,786 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:17:32,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,829 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,879 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,879 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,887 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,887 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,888 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,890 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,900 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,933 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,940 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:17:32,957 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 02:17:32,979 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:17:32,980 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:17:32,980 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:17:32,980 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:17:32,980 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:17:32,980 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:17:32,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:17:32,980 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:17:32,995 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 153 places, 178 transitions [2019-12-28 02:17:53,630 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111188 states. [2019-12-28 02:17:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 111188 states. [2019-12-28 02:17:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-28 02:17:53,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:17:53,651 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] [2019-12-28 02:17:53,652 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:17:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:17:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash -734288522, now seen corresponding path program 1 times [2019-12-28 02:17:53,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:17:53,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123135891] [2019-12-28 02:17:53,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:17:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:17:54,039 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-28 02:17:54,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123135891] [2019-12-28 02:17:54,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:17:54,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:17:54,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1240148853] [2019-12-28 02:17:54,043 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:17:54,054 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:17:54,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 47 transitions. [2019-12-28 02:17:54,086 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:17:54,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:17:54,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:17:54,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:17:54,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:17:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:17:54,111 INFO L87 Difference]: Start difference. First operand 111188 states. Second operand 4 states. [2019-12-28 02:17:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:17:57,048 INFO L93 Difference]: Finished difference Result 114116 states and 522352 transitions. [2019-12-28 02:17:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:17:57,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-28 02:17:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:17:57,573 INFO L225 Difference]: With dead ends: 114116 [2019-12-28 02:17:57,573 INFO L226 Difference]: Without dead ends: 82836 [2019-12-28 02:17:57,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:17:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82836 states. [2019-12-28 02:18:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82836 to 82836. [2019-12-28 02:18:03,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82836 states. [2019-12-28 02:18:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82836 states to 82836 states and 380412 transitions. [2019-12-28 02:18:04,249 INFO L78 Accepts]: Start accepts. Automaton has 82836 states and 380412 transitions. Word has length 47 [2019-12-28 02:18:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:18:04,254 INFO L462 AbstractCegarLoop]: Abstraction has 82836 states and 380412 transitions. [2019-12-28 02:18:04,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:18:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 82836 states and 380412 transitions. [2019-12-28 02:18:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:18:04,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:18:04,274 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] [2019-12-28 02:18:04,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:18:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:18:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1401449056, now seen corresponding path program 1 times [2019-12-28 02:18:04,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:18:04,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572036974] [2019-12-28 02:18:04,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:18:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:18:04,436 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-28 02:18:04,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572036974] [2019-12-28 02:18:04,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:18:04,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:18:04,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28681960] [2019-12-28 02:18:04,437 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:18:04,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:18:04,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 02:18:04,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:18:04,462 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:18:04,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:18:04,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:18:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:18:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:18:04,465 INFO L87 Difference]: Start difference. First operand 82836 states and 380412 transitions. Second operand 5 states. [2019-12-28 02:18:09,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:18:09,904 INFO L93 Difference]: Finished difference Result 129236 states and 566704 transitions. [2019-12-28 02:18:09,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:18:09,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-28 02:18:09,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:18:10,558 INFO L225 Difference]: With dead ends: 129236 [2019-12-28 02:18:10,559 INFO L226 Difference]: Without dead ends: 126476 [2019-12-28 02:18:10,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:18:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126476 states. [2019-12-28 02:18:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126476 to 119960. [2019-12-28 02:18:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119960 states. [2019-12-28 02:18:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119960 states to 119960 states and 531551 transitions. [2019-12-28 02:18:15,131 INFO L78 Accepts]: Start accepts. Automaton has 119960 states and 531551 transitions. Word has length 55 [2019-12-28 02:18:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:18:15,132 INFO L462 AbstractCegarLoop]: Abstraction has 119960 states and 531551 transitions. [2019-12-28 02:18:15,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:18:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 119960 states and 531551 transitions. [2019-12-28 02:18:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 02:18:15,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:18:15,149 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] [2019-12-28 02:18:15,150 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:18:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:18:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash -861827498, now seen corresponding path program 1 times [2019-12-28 02:18:15,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:18:15,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639726388] [2019-12-28 02:18:15,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:18:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:18:15,281 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-28 02:18:15,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639726388] [2019-12-28 02:18:15,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:18:15,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:18:15,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028687201] [2019-12-28 02:18:15,282 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:18:15,291 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:18:15,304 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 128 transitions. [2019-12-28 02:18:15,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:18:15,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:18:15,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:18:15,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:18:15,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:18:15,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:18:15,391 INFO L87 Difference]: Start difference. First operand 119960 states and 531551 transitions. Second operand 6 states. [2019-12-28 02:18:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:18:22,217 INFO L93 Difference]: Finished difference Result 156372 states and 680700 transitions. [2019-12-28 02:18:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:18:22,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-28 02:18:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:18:22,871 INFO L225 Difference]: With dead ends: 156372 [2019-12-28 02:18:22,872 INFO L226 Difference]: Without dead ends: 154132 [2019-12-28 02:18:22,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:18:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154132 states. [2019-12-28 02:18:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154132 to 132944. [2019-12-28 02:18:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132944 states. [2019-12-28 02:18:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132944 states to 132944 states and 585325 transitions. [2019-12-28 02:18:27,449 INFO L78 Accepts]: Start accepts. Automaton has 132944 states and 585325 transitions. Word has length 56 [2019-12-28 02:18:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:18:27,449 INFO L462 AbstractCegarLoop]: Abstraction has 132944 states and 585325 transitions. [2019-12-28 02:18:27,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:18:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 132944 states and 585325 transitions. [2019-12-28 02:18:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-28 02:18:27,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:18:27,491 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] [2019-12-28 02:18:27,491 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:18:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:18:27,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1595989468, now seen corresponding path program 1 times [2019-12-28 02:18:27,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:18:27,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552649559] [2019-12-28 02:18:27,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:18:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:18:27,550 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-28 02:18:27,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552649559] [2019-12-28 02:18:27,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:18:27,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:18:27,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [946234761] [2019-12-28 02:18:27,554 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:18:27,562 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:18:27,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 146 transitions. [2019-12-28 02:18:27,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:18:27,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:18:27,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:18:27,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:18:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:18:27,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:18:27,599 INFO L87 Difference]: Start difference. First operand 132944 states and 585325 transitions. Second operand 4 states. [2019-12-28 02:18:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:18:29,805 INFO L93 Difference]: Finished difference Result 171276 states and 741342 transitions. [2019-12-28 02:18:29,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:18:29,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-28 02:18:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:18:30,365 INFO L225 Difference]: With dead ends: 171276 [2019-12-28 02:18:30,365 INFO L226 Difference]: Without dead ends: 171276 [2019-12-28 02:18:30,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:18:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171276 states. [2019-12-28 02:18:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171276 to 152000. [2019-12-28 02:18:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152000 states. [2019-12-28 02:18:41,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152000 states to 152000 states and 663353 transitions. [2019-12-28 02:18:41,507 INFO L78 Accepts]: Start accepts. Automaton has 152000 states and 663353 transitions. Word has length 58 [2019-12-28 02:18:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:18:41,507 INFO L462 AbstractCegarLoop]: Abstraction has 152000 states and 663353 transitions. [2019-12-28 02:18:41,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:18:41,508 INFO L276 IsEmpty]: Start isEmpty. Operand 152000 states and 663353 transitions. [2019-12-28 02:18:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 02:18:41,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:18:41,552 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] [2019-12-28 02:18:41,553 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:18:41,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:18:41,553 INFO L82 PathProgramCache]: Analyzing trace with hash 690675031, now seen corresponding path program 1 times [2019-12-28 02:18:41,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:18:41,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584623104] [2019-12-28 02:18:41,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:18:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:18:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:18:41,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584623104] [2019-12-28 02:18:41,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:18:41,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:18:41,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300392227] [2019-12-28 02:18:41,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:18:41,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:18:41,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 182 transitions. [2019-12-28 02:18:41,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:18:41,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:18:41,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:18:41,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:18:41,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:18:41,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:18:41,792 INFO L87 Difference]: Start difference. First operand 152000 states and 663353 transitions. Second operand 8 states. [2019-12-28 02:18:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:18:49,251 INFO L93 Difference]: Finished difference Result 196524 states and 843638 transitions. [2019-12-28 02:18:49,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:18:49,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-12-28 02:18:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:18:49,899 INFO L225 Difference]: With dead ends: 196524 [2019-12-28 02:18:49,899 INFO L226 Difference]: Without dead ends: 193924 [2019-12-28 02:18:49,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:18:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193924 states. [2019-12-28 02:18:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193924 to 153896. [2019-12-28 02:18:54,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153896 states. [2019-12-28 02:18:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153896 states to 153896 states and 672395 transitions. [2019-12-28 02:18:55,741 INFO L78 Accepts]: Start accepts. Automaton has 153896 states and 672395 transitions. Word has length 62 [2019-12-28 02:18:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:18:55,741 INFO L462 AbstractCegarLoop]: Abstraction has 153896 states and 672395 transitions. [2019-12-28 02:18:55,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:18:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 153896 states and 672395 transitions. [2019-12-28 02:18:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 02:18:55,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:18:55,787 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] [2019-12-28 02:18:55,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:18:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:18:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1587793502, now seen corresponding path program 1 times [2019-12-28 02:18:55,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:18:55,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544884384] [2019-12-28 02:18:55,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:18:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:18:55,913 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-28 02:18:55,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544884384] [2019-12-28 02:18:55,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:18:55,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:18:55,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123969486] [2019-12-28 02:18:55,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:18:55,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:18:55,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 66 transitions. [2019-12-28 02:18:55,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:18:55,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:18:55,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:18:55,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:18:55,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:18:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:18:55,934 INFO L87 Difference]: Start difference. First operand 153896 states and 672395 transitions. Second operand 6 states. [2019-12-28 02:18:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:18:59,249 INFO L93 Difference]: Finished difference Result 213000 states and 921027 transitions. [2019-12-28 02:18:59,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:18:59,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 02:18:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:19:00,021 INFO L225 Difference]: With dead ends: 213000 [2019-12-28 02:19:00,021 INFO L226 Difference]: Without dead ends: 209096 [2019-12-28 02:19:00,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:19:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209096 states. [2019-12-28 02:19:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209096 to 196108. [2019-12-28 02:19:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196108 states. [2019-12-28 02:19:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196108 states to 196108 states and 850978 transitions. [2019-12-28 02:19:14,254 INFO L78 Accepts]: Start accepts. Automaton has 196108 states and 850978 transitions. Word has length 62 [2019-12-28 02:19:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:19:14,254 INFO L462 AbstractCegarLoop]: Abstraction has 196108 states and 850978 transitions. [2019-12-28 02:19:14,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:19:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 196108 states and 850978 transitions. [2019-12-28 02:19:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 02:19:14,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:19:14,312 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] [2019-12-28 02:19:14,312 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:19:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:19:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash 910222435, now seen corresponding path program 1 times [2019-12-28 02:19:14,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:19:14,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809606021] [2019-12-28 02:19:14,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:19:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:19:14,430 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-28 02:19:14,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809606021] [2019-12-28 02:19:14,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:19:14,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:19:14,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182556656] [2019-12-28 02:19:14,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:19:14,438 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:19:14,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 66 transitions. [2019-12-28 02:19:14,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:19:14,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:19:14,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:19:14,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:19:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:19:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:19:14,448 INFO L87 Difference]: Start difference. First operand 196108 states and 850978 transitions. Second operand 7 states. [2019-12-28 02:19:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:19:23,918 INFO L93 Difference]: Finished difference Result 284568 states and 1194511 transitions. [2019-12-28 02:19:23,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:19:23,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-28 02:19:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:19:24,943 INFO L225 Difference]: With dead ends: 284568 [2019-12-28 02:19:24,943 INFO L226 Difference]: Without dead ends: 284568 [2019-12-28 02:19:24,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:19:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284568 states. [2019-12-28 02:19:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284568 to 232540. [2019-12-28 02:19:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232540 states. [2019-12-28 02:19:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232540 states to 232540 states and 989998 transitions. [2019-12-28 02:19:43,860 INFO L78 Accepts]: Start accepts. Automaton has 232540 states and 989998 transitions. Word has length 62 [2019-12-28 02:19:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:19:43,861 INFO L462 AbstractCegarLoop]: Abstraction has 232540 states and 989998 transitions. [2019-12-28 02:19:43,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:19:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 232540 states and 989998 transitions. [2019-12-28 02:19:43,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 02:19:43,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:19:43,910 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] [2019-12-28 02:19:43,910 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:19:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:19:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1797726116, now seen corresponding path program 1 times [2019-12-28 02:19:43,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:19:43,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598910936] [2019-12-28 02:19:43,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:19:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:19:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:19:43,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598910936] [2019-12-28 02:19:43,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:19:43,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:19:43,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520332429] [2019-12-28 02:19:43,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:19:43,999 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:19:44,010 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 66 transitions. [2019-12-28 02:19:44,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:19:44,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:19:44,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:19:44,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:19:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:19:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:19:44,022 INFO L87 Difference]: Start difference. First operand 232540 states and 989998 transitions. Second operand 4 states. [2019-12-28 02:19:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:19:45,094 INFO L93 Difference]: Finished difference Result 189767 states and 786508 transitions. [2019-12-28 02:19:45,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:19:45,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-28 02:19:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:19:47,443 INFO L225 Difference]: With dead ends: 189767 [2019-12-28 02:19:47,443 INFO L226 Difference]: Without dead ends: 183771 [2019-12-28 02:19:47,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 02:19:48,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183771 states. [2019-12-28 02:19:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183771 to 183771. [2019-12-28 02:19:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183771 states. [2019-12-28 02:19:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183771 states to 183771 states and 765838 transitions. [2019-12-28 02:19:59,267 INFO L78 Accepts]: Start accepts. Automaton has 183771 states and 765838 transitions. Word has length 62 [2019-12-28 02:19:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:19:59,267 INFO L462 AbstractCegarLoop]: Abstraction has 183771 states and 765838 transitions. [2019-12-28 02:19:59,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:19:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 183771 states and 765838 transitions. [2019-12-28 02:19:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:19:59,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:19:59,310 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] [2019-12-28 02:19:59,310 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:19:59,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:19:59,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1299870988, now seen corresponding path program 1 times [2019-12-28 02:19:59,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:19:59,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879889497] [2019-12-28 02:19:59,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:19:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:19:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:19:59,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879889497] [2019-12-28 02:19:59,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:19:59,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:19:59,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [981531970] [2019-12-28 02:19:59,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:19:59,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:19:59,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 75 states and 85 transitions. [2019-12-28 02:19:59,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:19:59,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:19:59,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:19:59,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:19:59,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:19:59,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:19:59,412 INFO L87 Difference]: Start difference. First operand 183771 states and 765838 transitions. Second operand 5 states. [2019-12-28 02:19:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:19:59,608 INFO L93 Difference]: Finished difference Result 34884 states and 130108 transitions. [2019-12-28 02:19:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:19:59,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-28 02:19:59,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:19:59,675 INFO L225 Difference]: With dead ends: 34884 [2019-12-28 02:19:59,675 INFO L226 Difference]: Without dead ends: 30057 [2019-12-28 02:19:59,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:19:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30057 states. [2019-12-28 02:20:00,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30057 to 29865. [2019-12-28 02:20:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29865 states. [2019-12-28 02:20:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29865 states to 29865 states and 110398 transitions. [2019-12-28 02:20:00,202 INFO L78 Accepts]: Start accepts. Automaton has 29865 states and 110398 transitions. Word has length 63 [2019-12-28 02:20:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:00,203 INFO L462 AbstractCegarLoop]: Abstraction has 29865 states and 110398 transitions. [2019-12-28 02:20:00,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:20:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29865 states and 110398 transitions. [2019-12-28 02:20:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 02:20:00,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:00,220 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, 1, 1, 1, 1, 1, 1] [2019-12-28 02:20:00,220 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:00,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:00,221 INFO L82 PathProgramCache]: Analyzing trace with hash -315278724, now seen corresponding path program 1 times [2019-12-28 02:20:00,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:00,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986051175] [2019-12-28 02:20:00,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:20:00,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986051175] [2019-12-28 02:20:00,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:00,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:20:00,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145912376] [2019-12-28 02:20:00,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:00,292 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:00,364 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 449 transitions. [2019-12-28 02:20:00,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:00,392 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:20:00,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:20:00,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:20:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:20:00,393 INFO L87 Difference]: Start difference. First operand 29865 states and 110398 transitions. Second operand 5 states. [2019-12-28 02:20:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:00,819 INFO L93 Difference]: Finished difference Result 34926 states and 128760 transitions. [2019-12-28 02:20:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:20:00,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-28 02:20:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:00,938 INFO L225 Difference]: With dead ends: 34926 [2019-12-28 02:20:00,938 INFO L226 Difference]: Without dead ends: 34926 [2019-12-28 02:20:00,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34926 states. [2019-12-28 02:20:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34926 to 31803. [2019-12-28 02:20:03,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31803 states. [2019-12-28 02:20:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31803 states to 31803 states and 117324 transitions. [2019-12-28 02:20:03,929 INFO L78 Accepts]: Start accepts. Automaton has 31803 states and 117324 transitions. Word has length 73 [2019-12-28 02:20:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:03,929 INFO L462 AbstractCegarLoop]: Abstraction has 31803 states and 117324 transitions. [2019-12-28 02:20:03,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:20:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31803 states and 117324 transitions. [2019-12-28 02:20:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-28 02:20:03,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:03,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:20:03,949 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:03,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1427531611, now seen corresponding path program 1 times [2019-12-28 02:20:03,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:03,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679970433] [2019-12-28 02:20:03,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:04,050 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-28 02:20:04,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679970433] [2019-12-28 02:20:04,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:04,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:20:04,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [454390025] [2019-12-28 02:20:04,052 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:04,064 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:04,131 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 449 transitions. [2019-12-28 02:20:04,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:04,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:20:04,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:20:04,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:20:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:20:04,155 INFO L87 Difference]: Start difference. First operand 31803 states and 117324 transitions. Second operand 7 states. [2019-12-28 02:20:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:04,880 INFO L93 Difference]: Finished difference Result 40979 states and 149243 transitions. [2019-12-28 02:20:04,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 02:20:04,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-28 02:20:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:04,974 INFO L225 Difference]: With dead ends: 40979 [2019-12-28 02:20:04,974 INFO L226 Difference]: Without dead ends: 40799 [2019-12-28 02:20:04,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:20:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40799 states. [2019-12-28 02:20:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40799 to 34294. [2019-12-28 02:20:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34294 states. [2019-12-28 02:20:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34294 states to 34294 states and 125838 transitions. [2019-12-28 02:20:05,915 INFO L78 Accepts]: Start accepts. Automaton has 34294 states and 125838 transitions. Word has length 73 [2019-12-28 02:20:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:05,915 INFO L462 AbstractCegarLoop]: Abstraction has 34294 states and 125838 transitions. [2019-12-28 02:20:05,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:20:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 34294 states and 125838 transitions. [2019-12-28 02:20:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:20:05,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:05,935 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:20:05,935 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash -671007420, now seen corresponding path program 1 times [2019-12-28 02:20:05,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:05,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322387594] [2019-12-28 02:20:05,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:06,000 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-28 02:20:06,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322387594] [2019-12-28 02:20:06,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:06,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:20:06,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220448025] [2019-12-28 02:20:06,001 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:06,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:06,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 02:20:06,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:06,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:06,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:20:06,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:20:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:20:06,040 INFO L87 Difference]: Start difference. First operand 34294 states and 125838 transitions. Second operand 4 states. [2019-12-28 02:20:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:06,420 INFO L93 Difference]: Finished difference Result 43212 states and 156687 transitions. [2019-12-28 02:20:06,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:20:06,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-28 02:20:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:06,513 INFO L225 Difference]: With dead ends: 43212 [2019-12-28 02:20:06,513 INFO L226 Difference]: Without dead ends: 43212 [2019-12-28 02:20:06,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:20:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43212 states. [2019-12-28 02:20:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43212 to 39522. [2019-12-28 02:20:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39522 states. [2019-12-28 02:20:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39522 states to 39522 states and 143619 transitions. [2019-12-28 02:20:07,720 INFO L78 Accepts]: Start accepts. Automaton has 39522 states and 143619 transitions. Word has length 75 [2019-12-28 02:20:07,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:07,720 INFO L462 AbstractCegarLoop]: Abstraction has 39522 states and 143619 transitions. [2019-12-28 02:20:07,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:20:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 39522 states and 143619 transitions. [2019-12-28 02:20:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:20:07,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:07,747 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:20:07,747 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:07,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:07,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1546750533, now seen corresponding path program 1 times [2019-12-28 02:20:07,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:07,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073159337] [2019-12-28 02:20:07,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:07,781 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-28 02:20:07,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073159337] [2019-12-28 02:20:07,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:07,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:20:07,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [461575690] [2019-12-28 02:20:07,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:07,813 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:07,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 02:20:07,843 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:07,843 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:07,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:20:07,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:07,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:20:07,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:20:07,844 INFO L87 Difference]: Start difference. First operand 39522 states and 143619 transitions. Second operand 3 states. [2019-12-28 02:20:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:08,169 INFO L93 Difference]: Finished difference Result 41335 states and 149660 transitions. [2019-12-28 02:20:08,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:20:08,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-28 02:20:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:08,251 INFO L225 Difference]: With dead ends: 41335 [2019-12-28 02:20:08,251 INFO L226 Difference]: Without dead ends: 41335 [2019-12-28 02:20:08,252 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-28 02:20:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41335 states. [2019-12-28 02:20:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41335 to 40524. [2019-12-28 02:20:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40524 states. [2019-12-28 02:20:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40524 states to 40524 states and 146941 transitions. [2019-12-28 02:20:08,909 INFO L78 Accepts]: Start accepts. Automaton has 40524 states and 146941 transitions. Word has length 75 [2019-12-28 02:20:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:08,909 INFO L462 AbstractCegarLoop]: Abstraction has 40524 states and 146941 transitions. [2019-12-28 02:20:08,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:20:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 40524 states and 146941 transitions. [2019-12-28 02:20:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 02:20:08,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:08,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:20:08,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:08,944 INFO L82 PathProgramCache]: Analyzing trace with hash 935220688, now seen corresponding path program 1 times [2019-12-28 02:20:08,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:08,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181189767] [2019-12-28 02:20:08,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:09,405 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-28 02:20:09,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181189767] [2019-12-28 02:20:09,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:09,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:20:09,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1433829274] [2019-12-28 02:20:09,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:09,421 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:09,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 97 transitions. [2019-12-28 02:20:09,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:09,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 02:20:09,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:20:09,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:20:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:09,445 INFO L87 Difference]: Start difference. First operand 40524 states and 146941 transitions. Second operand 6 states. [2019-12-28 02:20:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:10,066 INFO L93 Difference]: Finished difference Result 45113 states and 161733 transitions. [2019-12-28 02:20:10,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:20:10,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-28 02:20:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:10,153 INFO L225 Difference]: With dead ends: 45113 [2019-12-28 02:20:10,153 INFO L226 Difference]: Without dead ends: 45113 [2019-12-28 02:20:10,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:20:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45113 states. [2019-12-28 02:20:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45113 to 43400. [2019-12-28 02:20:10,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43400 states. [2019-12-28 02:20:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43400 states to 43400 states and 156064 transitions. [2019-12-28 02:20:10,893 INFO L78 Accepts]: Start accepts. Automaton has 43400 states and 156064 transitions. Word has length 77 [2019-12-28 02:20:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:10,894 INFO L462 AbstractCegarLoop]: Abstraction has 43400 states and 156064 transitions. [2019-12-28 02:20:10,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:20:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43400 states and 156064 transitions. [2019-12-28 02:20:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 02:20:10,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:10,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:20:10,935 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1141988655, now seen corresponding path program 1 times [2019-12-28 02:20:10,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:10,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624058519] [2019-12-28 02:20:10,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:11,028 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-28 02:20:11,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624058519] [2019-12-28 02:20:11,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:11,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:20:11,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [107151205] [2019-12-28 02:20:11,030 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:11,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:11,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 97 transitions. [2019-12-28 02:20:11,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:11,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:11,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:20:11,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:11,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:20:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:11,068 INFO L87 Difference]: Start difference. First operand 43400 states and 156064 transitions. Second operand 6 states. [2019-12-28 02:20:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:12,077 INFO L93 Difference]: Finished difference Result 51189 states and 179499 transitions. [2019-12-28 02:20:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:20:12,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-28 02:20:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:12,183 INFO L225 Difference]: With dead ends: 51189 [2019-12-28 02:20:12,184 INFO L226 Difference]: Without dead ends: 51189 [2019-12-28 02:20:12,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:20:12,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51189 states. [2019-12-28 02:20:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51189 to 45432. [2019-12-28 02:20:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45432 states. [2019-12-28 02:20:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45432 states to 45432 states and 160428 transitions. [2019-12-28 02:20:13,038 INFO L78 Accepts]: Start accepts. Automaton has 45432 states and 160428 transitions. Word has length 77 [2019-12-28 02:20:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:13,038 INFO L462 AbstractCegarLoop]: Abstraction has 45432 states and 160428 transitions. [2019-12-28 02:20:13,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:20:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 45432 states and 160428 transitions. [2019-12-28 02:20:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 02:20:13,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:13,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:20:13,080 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash -930637742, now seen corresponding path program 1 times [2019-12-28 02:20:13,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:13,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048958206] [2019-12-28 02:20:13,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:13,160 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-28 02:20:13,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048958206] [2019-12-28 02:20:13,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:13,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:20:13,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65099437] [2019-12-28 02:20:13,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:13,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:13,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 97 transitions. [2019-12-28 02:20:13,201 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:13,202 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 02:20:13,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:20:13,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:20:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:20:13,203 INFO L87 Difference]: Start difference. First operand 45432 states and 160428 transitions. Second operand 5 states. [2019-12-28 02:20:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:14,145 INFO L93 Difference]: Finished difference Result 57021 states and 200693 transitions. [2019-12-28 02:20:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:20:14,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-28 02:20:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:14,260 INFO L225 Difference]: With dead ends: 57021 [2019-12-28 02:20:14,260 INFO L226 Difference]: Without dead ends: 57021 [2019-12-28 02:20:14,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:20:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57021 states. [2019-12-28 02:20:14,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57021 to 49071. [2019-12-28 02:20:14,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49071 states. [2019-12-28 02:20:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49071 states to 49071 states and 172039 transitions. [2019-12-28 02:20:15,133 INFO L78 Accepts]: Start accepts. Automaton has 49071 states and 172039 transitions. Word has length 77 [2019-12-28 02:20:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:15,133 INFO L462 AbstractCegarLoop]: Abstraction has 49071 states and 172039 transitions. [2019-12-28 02:20:15,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:20:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 49071 states and 172039 transitions. [2019-12-28 02:20:15,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 02:20:15,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:20:15,177 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:15,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:15,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1441171919, now seen corresponding path program 1 times [2019-12-28 02:20:15,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:15,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072354693] [2019-12-28 02:20:15,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:15,238 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-28 02:20:15,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072354693] [2019-12-28 02:20:15,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:15,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:20:15,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374613121] [2019-12-28 02:20:15,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:15,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:15,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 97 transitions. [2019-12-28 02:20:15,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:15,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:15,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:20:15,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:15,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:20:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:20:15,270 INFO L87 Difference]: Start difference. First operand 49071 states and 172039 transitions. Second operand 5 states. [2019-12-28 02:20:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:16,399 INFO L93 Difference]: Finished difference Result 64395 states and 225638 transitions. [2019-12-28 02:20:16,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:20:16,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-28 02:20:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:16,544 INFO L225 Difference]: With dead ends: 64395 [2019-12-28 02:20:16,544 INFO L226 Difference]: Without dead ends: 64395 [2019-12-28 02:20:16,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:20:16,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64395 states. [2019-12-28 02:20:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64395 to 51959. [2019-12-28 02:20:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51959 states. [2019-12-28 02:20:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51959 states to 51959 states and 182153 transitions. [2019-12-28 02:20:17,555 INFO L78 Accepts]: Start accepts. Automaton has 51959 states and 182153 transitions. Word has length 77 [2019-12-28 02:20:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:17,555 INFO L462 AbstractCegarLoop]: Abstraction has 51959 states and 182153 transitions. [2019-12-28 02:20:17,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:20:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 51959 states and 182153 transitions. [2019-12-28 02:20:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-28 02:20:17,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:17,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:20:17,598 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:17,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1046340914, now seen corresponding path program 1 times [2019-12-28 02:20:17,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:17,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070629011] [2019-12-28 02:20:17,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:17,685 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-28 02:20:17,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070629011] [2019-12-28 02:20:17,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:17,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:20:17,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376932754] [2019-12-28 02:20:17,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:17,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:17,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 97 transitions. [2019-12-28 02:20:17,722 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:17,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:17,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:20:17,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:20:17,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:17,723 INFO L87 Difference]: Start difference. First operand 51959 states and 182153 transitions. Second operand 6 states. [2019-12-28 02:20:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:17,946 INFO L93 Difference]: Finished difference Result 21143 states and 64322 transitions. [2019-12-28 02:20:17,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:20:17,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-12-28 02:20:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:17,996 INFO L225 Difference]: With dead ends: 21143 [2019-12-28 02:20:17,997 INFO L226 Difference]: Without dead ends: 17694 [2019-12-28 02:20:17,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:20:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2019-12-28 02:20:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 15290. [2019-12-28 02:20:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15290 states. [2019-12-28 02:20:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15290 states to 15290 states and 46304 transitions. [2019-12-28 02:20:19,075 INFO L78 Accepts]: Start accepts. Automaton has 15290 states and 46304 transitions. Word has length 77 [2019-12-28 02:20:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:19,075 INFO L462 AbstractCegarLoop]: Abstraction has 15290 states and 46304 transitions. [2019-12-28 02:20:19,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:20:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 15290 states and 46304 transitions. [2019-12-28 02:20:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 02:20:19,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:19,110 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, 1, 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-28 02:20:19,110 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:19,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1323973914, now seen corresponding path program 1 times [2019-12-28 02:20:19,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:19,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845171222] [2019-12-28 02:20:19,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:19,222 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-28 02:20:19,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845171222] [2019-12-28 02:20:19,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:19,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:20:19,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [869840492] [2019-12-28 02:20:19,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:19,270 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:19,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 262 transitions. [2019-12-28 02:20:19,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:19,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:20:19,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:20:19,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:20:19,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:20:19,447 INFO L87 Difference]: Start difference. First operand 15290 states and 46304 transitions. Second operand 7 states. [2019-12-28 02:20:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:20,412 INFO L93 Difference]: Finished difference Result 21670 states and 63370 transitions. [2019-12-28 02:20:20,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 02:20:20,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-28 02:20:20,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:20,445 INFO L225 Difference]: With dead ends: 21670 [2019-12-28 02:20:20,445 INFO L226 Difference]: Without dead ends: 21422 [2019-12-28 02:20:20,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:20:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2019-12-28 02:20:20,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 15766. [2019-12-28 02:20:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15766 states. [2019-12-28 02:20:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15766 states to 15766 states and 46189 transitions. [2019-12-28 02:20:20,722 INFO L78 Accepts]: Start accepts. Automaton has 15766 states and 46189 transitions. Word has length 92 [2019-12-28 02:20:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:20,723 INFO L462 AbstractCegarLoop]: Abstraction has 15766 states and 46189 transitions. [2019-12-28 02:20:20,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:20:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15766 states and 46189 transitions. [2019-12-28 02:20:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 02:20:20,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:20,743 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, 1, 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-28 02:20:20,743 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:20,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1945910238, now seen corresponding path program 2 times [2019-12-28 02:20:20,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:20,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905161033] [2019-12-28 02:20:20,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:20,839 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-28 02:20:20,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905161033] [2019-12-28 02:20:20,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:20,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:20:20,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [198294371] [2019-12-28 02:20:20,840 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:20,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:20,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 245 transitions. [2019-12-28 02:20:20,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:20,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:20,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:20:20,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:20,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:20:20,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:20:20,955 INFO L87 Difference]: Start difference. First operand 15766 states and 46189 transitions. Second operand 7 states. [2019-12-28 02:20:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:21,391 INFO L93 Difference]: Finished difference Result 22190 states and 64709 transitions. [2019-12-28 02:20:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:20:21,391 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-28 02:20:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:21,421 INFO L225 Difference]: With dead ends: 22190 [2019-12-28 02:20:21,421 INFO L226 Difference]: Without dead ends: 22136 [2019-12-28 02:20:21,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:20:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22136 states. [2019-12-28 02:20:21,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22136 to 19480. [2019-12-28 02:20:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19480 states. [2019-12-28 02:20:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19480 states to 19480 states and 56992 transitions. [2019-12-28 02:20:21,700 INFO L78 Accepts]: Start accepts. Automaton has 19480 states and 56992 transitions. Word has length 92 [2019-12-28 02:20:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:21,701 INFO L462 AbstractCegarLoop]: Abstraction has 19480 states and 56992 transitions. [2019-12-28 02:20:21,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:20:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19480 states and 56992 transitions. [2019-12-28 02:20:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 02:20:21,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:21,723 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, 1, 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-28 02:20:21,723 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash 148958879, now seen corresponding path program 1 times [2019-12-28 02:20:21,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:21,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722919240] [2019-12-28 02:20:21,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:22,056 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-28 02:20:22,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722919240] [2019-12-28 02:20:22,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:22,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:20:22,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1397792934] [2019-12-28 02:20:22,057 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:22,079 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:22,160 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 245 transitions. [2019-12-28 02:20:22,161 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:22,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:20:22,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:20:22,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:20:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:20:22,187 INFO L87 Difference]: Start difference. First operand 19480 states and 56992 transitions. Second operand 9 states. [2019-12-28 02:20:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:23,777 INFO L93 Difference]: Finished difference Result 52474 states and 155284 transitions. [2019-12-28 02:20:23,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-28 02:20:23,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-12-28 02:20:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:23,852 INFO L225 Difference]: With dead ends: 52474 [2019-12-28 02:20:23,852 INFO L226 Difference]: Without dead ends: 52474 [2019-12-28 02:20:23,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2019-12-28 02:20:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52474 states. [2019-12-28 02:20:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52474 to 21393. [2019-12-28 02:20:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21393 states. [2019-12-28 02:20:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21393 states to 21393 states and 62817 transitions. [2019-12-28 02:20:24,366 INFO L78 Accepts]: Start accepts. Automaton has 21393 states and 62817 transitions. Word has length 92 [2019-12-28 02:20:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:24,366 INFO L462 AbstractCegarLoop]: Abstraction has 21393 states and 62817 transitions. [2019-12-28 02:20:24,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:20:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 21393 states and 62817 transitions. [2019-12-28 02:20:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 02:20:24,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:24,389 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, 1, 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-28 02:20:24,389 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:24,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:24,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1036462560, now seen corresponding path program 1 times [2019-12-28 02:20:24,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:24,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771578462] [2019-12-28 02:20:24,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:24,502 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-28 02:20:24,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771578462] [2019-12-28 02:20:24,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:24,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:20:24,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984024617] [2019-12-28 02:20:24,504 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:24,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:24,630 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 245 transitions. [2019-12-28 02:20:24,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:24,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 02:20:24,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:20:24,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:24,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:20:24,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:24,636 INFO L87 Difference]: Start difference. First operand 21393 states and 62817 transitions. Second operand 6 states. [2019-12-28 02:20:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:24,954 INFO L93 Difference]: Finished difference Result 23396 states and 68388 transitions. [2019-12-28 02:20:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:20:24,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-28 02:20:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:24,987 INFO L225 Difference]: With dead ends: 23396 [2019-12-28 02:20:24,987 INFO L226 Difference]: Without dead ends: 23396 [2019-12-28 02:20:24,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23396 states. [2019-12-28 02:20:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23396 to 21073. [2019-12-28 02:20:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21073 states. [2019-12-28 02:20:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21073 states to 21073 states and 61937 transitions. [2019-12-28 02:20:25,548 INFO L78 Accepts]: Start accepts. Automaton has 21073 states and 61937 transitions. Word has length 92 [2019-12-28 02:20:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:25,549 INFO L462 AbstractCegarLoop]: Abstraction has 21073 states and 61937 transitions. [2019-12-28 02:20:25,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:20:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 21073 states and 61937 transitions. [2019-12-28 02:20:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 02:20:25,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:25,570 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, 1, 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-28 02:20:25,571 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash -605612705, now seen corresponding path program 1 times [2019-12-28 02:20:25,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:25,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061815491] [2019-12-28 02:20:25,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:25,693 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-28 02:20:25,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061815491] [2019-12-28 02:20:25,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:25,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:20:25,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766731416] [2019-12-28 02:20:25,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:25,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:25,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 211 transitions. [2019-12-28 02:20:25,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:25,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:25,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:20:25,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:25,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:20:25,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:25,794 INFO L87 Difference]: Start difference. First operand 21073 states and 61937 transitions. Second operand 6 states. [2019-12-28 02:20:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:26,037 INFO L93 Difference]: Finished difference Result 20614 states and 60047 transitions. [2019-12-28 02:20:26,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:20:26,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-28 02:20:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:26,088 INFO L225 Difference]: With dead ends: 20614 [2019-12-28 02:20:26,089 INFO L226 Difference]: Without dead ends: 20614 [2019-12-28 02:20:26,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:20:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20614 states. [2019-12-28 02:20:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20614 to 10865. [2019-12-28 02:20:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10865 states. [2019-12-28 02:20:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10865 states to 10865 states and 32071 transitions. [2019-12-28 02:20:26,483 INFO L78 Accepts]: Start accepts. Automaton has 10865 states and 32071 transitions. Word has length 92 [2019-12-28 02:20:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:26,483 INFO L462 AbstractCegarLoop]: Abstraction has 10865 states and 32071 transitions. [2019-12-28 02:20:26,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:20:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 10865 states and 32071 transitions. [2019-12-28 02:20:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:20:26,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:26,508 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, 1, 1, 1, 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-28 02:20:26,508 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:26,509 INFO L82 PathProgramCache]: Analyzing trace with hash -247317723, now seen corresponding path program 1 times [2019-12-28 02:20:26,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:26,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278823074] [2019-12-28 02:20:26,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:26,714 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-28 02:20:26,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278823074] [2019-12-28 02:20:26,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:26,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:20:26,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984757287] [2019-12-28 02:20:26,715 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:26,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:26,836 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 262 transitions. [2019-12-28 02:20:26,836 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:26,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:20:26,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 02:20:26,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 02:20:26,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:20:26,927 INFO L87 Difference]: Start difference. First operand 10865 states and 32071 transitions. Second operand 11 states. [2019-12-28 02:20:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:28,551 INFO L93 Difference]: Finished difference Result 14100 states and 41290 transitions. [2019-12-28 02:20:28,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 02:20:28,551 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-28 02:20:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:28,571 INFO L225 Difference]: With dead ends: 14100 [2019-12-28 02:20:28,571 INFO L226 Difference]: Without dead ends: 14100 [2019-12-28 02:20:28,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2019-12-28 02:20:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14100 states. [2019-12-28 02:20:28,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14100 to 12209. [2019-12-28 02:20:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-28 02:20:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 35863 transitions. [2019-12-28 02:20:28,743 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 35863 transitions. Word has length 94 [2019-12-28 02:20:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:28,744 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 35863 transitions. [2019-12-28 02:20:28,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 02:20:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 35863 transitions. [2019-12-28 02:20:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:20:28,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:28,758 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, 1, 1, 1, 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-28 02:20:28,758 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:28,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash 640185958, now seen corresponding path program 1 times [2019-12-28 02:20:28,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:28,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482480100] [2019-12-28 02:20:28,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:28,891 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-28 02:20:28,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482480100] [2019-12-28 02:20:28,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:28,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:20:28,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135075799] [2019-12-28 02:20:28,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:28,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:29,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 182 states and 262 transitions. [2019-12-28 02:20:29,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:29,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:20:29,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:20:29,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:29,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:20:29,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:20:29,237 INFO L87 Difference]: Start difference. First operand 12209 states and 35863 transitions. Second operand 9 states. [2019-12-28 02:20:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:30,024 INFO L93 Difference]: Finished difference Result 52160 states and 151900 transitions. [2019-12-28 02:20:30,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 02:20:30,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-28 02:20:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:30,070 INFO L225 Difference]: With dead ends: 52160 [2019-12-28 02:20:30,071 INFO L226 Difference]: Without dead ends: 32757 [2019-12-28 02:20:30,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-28 02:20:30,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32757 states. [2019-12-28 02:20:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32757 to 12643. [2019-12-28 02:20:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12643 states. [2019-12-28 02:20:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12643 states to 12643 states and 36853 transitions. [2019-12-28 02:20:30,355 INFO L78 Accepts]: Start accepts. Automaton has 12643 states and 36853 transitions. Word has length 94 [2019-12-28 02:20:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:30,355 INFO L462 AbstractCegarLoop]: Abstraction has 12643 states and 36853 transitions. [2019-12-28 02:20:30,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:20:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 12643 states and 36853 transitions. [2019-12-28 02:20:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:20:30,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:30,370 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, 1, 1, 1, 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-28 02:20:30,370 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1872976991, now seen corresponding path program 1 times [2019-12-28 02:20:30,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:30,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652458160] [2019-12-28 02:20:30,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:20:30,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652458160] [2019-12-28 02:20:30,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:30,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:20:30,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2029282966] [2019-12-28 02:20:30,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:30,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:30,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 204 transitions. [2019-12-28 02:20:30,543 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:30,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:30,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:20:30,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:20:30,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:20:30,544 INFO L87 Difference]: Start difference. First operand 12643 states and 36853 transitions. Second operand 7 states. [2019-12-28 02:20:31,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:31,173 INFO L93 Difference]: Finished difference Result 15414 states and 44706 transitions. [2019-12-28 02:20:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:20:31,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-28 02:20:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:31,195 INFO L225 Difference]: With dead ends: 15414 [2019-12-28 02:20:31,195 INFO L226 Difference]: Without dead ends: 15352 [2019-12-28 02:20:31,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:20:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15352 states. [2019-12-28 02:20:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15352 to 13327. [2019-12-28 02:20:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13327 states. [2019-12-28 02:20:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13327 states to 13327 states and 38767 transitions. [2019-12-28 02:20:31,383 INFO L78 Accepts]: Start accepts. Automaton has 13327 states and 38767 transitions. Word has length 94 [2019-12-28 02:20:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:31,384 INFO L462 AbstractCegarLoop]: Abstraction has 13327 states and 38767 transitions. [2019-12-28 02:20:31,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:20:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 13327 states and 38767 transitions. [2019-12-28 02:20:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:20:31,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:31,399 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, 1, 1, 1, 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-28 02:20:31,399 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash 344780962, now seen corresponding path program 2 times [2019-12-28 02:20:31,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:31,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348945507] [2019-12-28 02:20:31,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:31,520 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-28 02:20:31,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348945507] [2019-12-28 02:20:31,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:31,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:20:31,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110502652] [2019-12-28 02:20:31,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:31,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:31,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 204 transitions. [2019-12-28 02:20:31,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:31,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:31,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:20:31,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:20:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:20:31,628 INFO L87 Difference]: Start difference. First operand 13327 states and 38767 transitions. Second operand 8 states. [2019-12-28 02:20:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:31,831 INFO L93 Difference]: Finished difference Result 29074 states and 83687 transitions. [2019-12-28 02:20:31,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:20:31,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-28 02:20:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:31,857 INFO L225 Difference]: With dead ends: 29074 [2019-12-28 02:20:31,857 INFO L226 Difference]: Without dead ends: 17220 [2019-12-28 02:20:31,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:20:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2019-12-28 02:20:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 11826. [2019-12-28 02:20:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11826 states. [2019-12-28 02:20:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11826 states to 11826 states and 34156 transitions. [2019-12-28 02:20:32,344 INFO L78 Accepts]: Start accepts. Automaton has 11826 states and 34156 transitions. Word has length 94 [2019-12-28 02:20:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:32,345 INFO L462 AbstractCegarLoop]: Abstraction has 11826 states and 34156 transitions. [2019-12-28 02:20:32,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:20:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 11826 states and 34156 transitions. [2019-12-28 02:20:32,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:20:32,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:32,357 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, 1, 1, 1, 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-28 02:20:32,357 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -369153956, now seen corresponding path program 3 times [2019-12-28 02:20:32,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:32,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991399446] [2019-12-28 02:20:32,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:20:32,454 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-28 02:20:32,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991399446] [2019-12-28 02:20:32,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:20:32,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:20:32,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117009409] [2019-12-28 02:20:32,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:20:32,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:20:32,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 216 transitions. [2019-12-28 02:20:32,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:20:32,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:20:32,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:20:32,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:20:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:20:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:20:32,534 INFO L87 Difference]: Start difference. First operand 11826 states and 34156 transitions. Second operand 6 states. [2019-12-28 02:20:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:20:32,644 INFO L93 Difference]: Finished difference Result 18873 states and 54376 transitions. [2019-12-28 02:20:32,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:20:32,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-28 02:20:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:20:32,656 INFO L225 Difference]: With dead ends: 18873 [2019-12-28 02:20:32,656 INFO L226 Difference]: Without dead ends: 7276 [2019-12-28 02:20:32,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:20:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7276 states. [2019-12-28 02:20:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7276 to 7276. [2019-12-28 02:20:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7276 states. [2019-12-28 02:20:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7276 states to 7276 states and 20753 transitions. [2019-12-28 02:20:32,754 INFO L78 Accepts]: Start accepts. Automaton has 7276 states and 20753 transitions. Word has length 94 [2019-12-28 02:20:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:20:32,754 INFO L462 AbstractCegarLoop]: Abstraction has 7276 states and 20753 transitions. [2019-12-28 02:20:32,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:20:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7276 states and 20753 transitions. [2019-12-28 02:20:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-28 02:20:32,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:20:32,763 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, 1, 1, 1, 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-28 02:20:32,763 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:20:32,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:20:32,764 INFO L82 PathProgramCache]: Analyzing trace with hash 907836508, now seen corresponding path program 4 times [2019-12-28 02:20:32,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:20:32,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570838214] [2019-12-28 02:20:32,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:20:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:20:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:20:32,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:20:32,854 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:20:33,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:20:33 BasicIcfg [2019-12-28 02:20:33,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:20:33,048 INFO L168 Benchmark]: Toolchain (without parser) took 181897.17 ms. Allocated memory was 144.7 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 02:20:33,051 INFO L168 Benchmark]: CDTParser took 1.60 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 02:20:33,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.00 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 154.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-28 02:20:33,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.73 ms. Allocated memory is still 201.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:20:33,054 INFO L168 Benchmark]: Boogie Preprocessor took 59.56 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:20:33,055 INFO L168 Benchmark]: RCFGBuilder took 725.58 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 105.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:20:33,055 INFO L168 Benchmark]: TraceAbstraction took 180284.96 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 104.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 957.6 MB. Max. memory is 7.1 GB. [2019-12-28 02:20:33,059 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.00 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 154.4 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.73 ms. Allocated memory is still 201.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.56 ms. Allocated memory is still 201.9 MB. Free memory was 151.7 MB in the beginning and 149.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 725.58 ms. Allocated memory is still 201.9 MB. Free memory was 149.6 MB in the beginning and 105.6 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 180284.96 ms. Allocated memory was 201.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 104.9 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 957.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L699] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L701] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L703] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L704] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L705] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L707] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L709] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L711] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L712] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L713] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L714] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L715] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L716] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L717] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L718] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L719] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t1004; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L821] 0 pthread_t t1005; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1006; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 3 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 [L791] 3 __unbuffered_p2_EAX = z [L794] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L741] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = y$flush_delayed ? y$mem_tmp : y [L764] 2 y$flush_delayed = (_Bool)0 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L831] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 179.8s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 60.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8788 SDtfs, 10828 SDslu, 23755 SDs, 0 SdLazy, 7631 SolverSat, 486 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 136 SyntacticMatches, 12 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232540occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 91.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 277494 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2232 NumberOfCodeBlocks, 2232 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2110 ConstructedInterpolants, 0 QuantifiedInterpolants, 453845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...