/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/mix052_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:11:02,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:11:02,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:11:02,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:11:02,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:11:02,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:11:02,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:11:02,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:11:02,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:11:02,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:11:02,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:11:02,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:11:02,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:11:02,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:11:02,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:11:02,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:11:02,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:11:02,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:11:02,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:11:02,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:11:02,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:11:02,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:11:02,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:11:02,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:11:02,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:11:02,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:11:02,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:11:02,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:11:02,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:11:02,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:11:02,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:11:02,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:11:02,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:11:02,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:11:02,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:11:02,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:11:02,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:11:02,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:11:02,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:11:02,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:11:02,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:11:02,074 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 03:11:02,088 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:11:02,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:11:02,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:11:02,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:11:02,094 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:11:02,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:11:02,095 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:11:02,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:11:02,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:11:02,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:11:02,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:11:02,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:11:02,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:11:02,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:11:02,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:11:02,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:11:02,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:11:02,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:11:02,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:11:02,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:11:02,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:11:02,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:11:02,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:11:02,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:11:02,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:11:02,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:11:02,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:11:02,100 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:11:02,101 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:11:02,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:11:02,101 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:11:02,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:11:02,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:11:02,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:11:02,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:11:02,399 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:11:02,400 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:11:02,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i [2019-12-28 03:11:02,475 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb4401cc/d0d1220728ba42859e609130f45f855f/FLAG37ec8ac30 [2019-12-28 03:11:03,060 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:11:03,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i [2019-12-28 03:11:03,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb4401cc/d0d1220728ba42859e609130f45f855f/FLAG37ec8ac30 [2019-12-28 03:11:03,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb4401cc/d0d1220728ba42859e609130f45f855f [2019-12-28 03:11:03,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:11:03,349 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:11:03,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:11:03,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:11:03,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:11:03,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:11:03" (1/1) ... [2019-12-28 03:11:03,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ede25d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:03, skipping insertion in model container [2019-12-28 03:11:03,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:11:03" (1/1) ... [2019-12-28 03:11:03,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:11:03,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:11:04,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:11:04,023 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:11:04,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:11:04,157 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:11:04,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04 WrapperNode [2019-12-28 03:11:04,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:11:04,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:11:04,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:11:04,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:11:04,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:11:04,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:11:04,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:11:04,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:11:04,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... [2019-12-28 03:11:04,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:11:04,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:11:04,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:11:04,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:11:04,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:11:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:11:04,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:11:04,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:11:04,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:11:04,331 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:11:04,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:11:04,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:11:04,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:11:04,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-28 03:11:04,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-28 03:11:04,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:11:04,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:11:04,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:11:04,335 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 03:11:05,067 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:11:05,067 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:11:05,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:11:05 BoogieIcfgContainer [2019-12-28 03:11:05,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:11:05,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:11:05,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:11:05,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:11:05,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:11:03" (1/3) ... [2019-12-28 03:11:05,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:11:05, skipping insertion in model container [2019-12-28 03:11:05,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:11:04" (2/3) ... [2019-12-28 03:11:05,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb6a79e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:11:05, skipping insertion in model container [2019-12-28 03:11:05,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:11:05" (3/3) ... [2019-12-28 03:11:05,078 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.opt.i [2019-12-28 03:11:05,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:11:05,087 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:11:05,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:11:05,097 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:11:05,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,163 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,163 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,163 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,175 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,181 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,206 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:11:05,229 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-28 03:11:05,252 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:11:05,252 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:11:05,252 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:11:05,252 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:11:05,252 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:11:05,253 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:11:05,253 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:11:05,253 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:11:05,267 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 176 transitions [2019-12-28 03:11:24,268 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111186 states. [2019-12-28 03:11:24,270 INFO L276 IsEmpty]: Start isEmpty. Operand 111186 states. [2019-12-28 03:11:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 03:11:24,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:11:24,286 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] [2019-12-28 03:11:24,287 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 03:11:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:11:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1048341095, now seen corresponding path program 1 times [2019-12-28 03:11:24,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:11:24,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906167696] [2019-12-28 03:11:24,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:11:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:11:24,727 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 03:11:24,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906167696] [2019-12-28 03:11:24,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:11:24,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:11:24,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842379681] [2019-12-28 03:11:24,731 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:11:24,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:11:24,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 45 transitions. [2019-12-28 03:11:24,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:11:24,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:11:24,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:11:24,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:11:24,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:11:24,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:11:24,788 INFO L87 Difference]: Start difference. First operand 111186 states. Second operand 4 states. [2019-12-28 03:11:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:11:28,714 INFO L93 Difference]: Finished difference Result 114114 states and 522350 transitions. [2019-12-28 03:11:28,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:11:28,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-28 03:11:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:11:29,389 INFO L225 Difference]: With dead ends: 114114 [2019-12-28 03:11:29,389 INFO L226 Difference]: Without dead ends: 82834 [2019-12-28 03:11:29,391 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 03:11:30,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82834 states. [2019-12-28 03:11:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82834 to 82834. [2019-12-28 03:11:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82834 states. [2019-12-28 03:11:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82834 states to 82834 states and 380410 transitions. [2019-12-28 03:11:36,155 INFO L78 Accepts]: Start accepts. Automaton has 82834 states and 380410 transitions. Word has length 45 [2019-12-28 03:11:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:11:36,157 INFO L462 AbstractCegarLoop]: Abstraction has 82834 states and 380410 transitions. [2019-12-28 03:11:36,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:11:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 82834 states and 380410 transitions. [2019-12-28 03:11:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:11:36,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:11:36,178 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] [2019-12-28 03:11:36,178 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 03:11:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:11:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1691216169, now seen corresponding path program 1 times [2019-12-28 03:11:36,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:11:36,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796943565] [2019-12-28 03:11:36,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:11:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:11:36,337 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 03:11:36,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796943565] [2019-12-28 03:11:36,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:11:36,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:11:36,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72283950] [2019-12-28 03:11:36,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:11:36,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:11:36,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 53 transitions. [2019-12-28 03:11:36,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:11:36,356 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:11:36,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:11:36,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:11:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:11:36,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:11:36,359 INFO L87 Difference]: Start difference. First operand 82834 states and 380410 transitions. Second operand 5 states. [2019-12-28 03:11:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:11:41,452 INFO L93 Difference]: Finished difference Result 129234 states and 566702 transitions. [2019-12-28 03:11:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:11:41,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-28 03:11:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:11:42,161 INFO L225 Difference]: With dead ends: 129234 [2019-12-28 03:11:42,161 INFO L226 Difference]: Without dead ends: 126474 [2019-12-28 03:11:42,163 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 03:11:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126474 states. [2019-12-28 03:11:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126474 to 119958. [2019-12-28 03:11:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119958 states. [2019-12-28 03:11:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119958 states to 119958 states and 531549 transitions. [2019-12-28 03:11:45,933 INFO L78 Accepts]: Start accepts. Automaton has 119958 states and 531549 transitions. Word has length 53 [2019-12-28 03:11:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:11:45,934 INFO L462 AbstractCegarLoop]: Abstraction has 119958 states and 531549 transitions. [2019-12-28 03:11:45,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:11:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 119958 states and 531549 transitions. [2019-12-28 03:11:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-28 03:11:45,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:11:45,945 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] [2019-12-28 03:11:45,946 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 03:11:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:11:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1644668799, now seen corresponding path program 1 times [2019-12-28 03:11:45,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:11:45,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509637918] [2019-12-28 03:11:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:11:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:11:46,042 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 03:11:46,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509637918] [2019-12-28 03:11:46,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:11:46,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:11:46,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251884548] [2019-12-28 03:11:46,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:11:46,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:11:46,064 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 126 transitions. [2019-12-28 03:11:46,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:11:46,156 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:11:46,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:11:46,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:11:46,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:11:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:11:46,157 INFO L87 Difference]: Start difference. First operand 119958 states and 531549 transitions. Second operand 6 states. [2019-12-28 03:11:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:11:51,592 INFO L93 Difference]: Finished difference Result 156370 states and 680698 transitions. [2019-12-28 03:11:51,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:11:51,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-28 03:11:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:11:52,265 INFO L225 Difference]: With dead ends: 156370 [2019-12-28 03:11:52,265 INFO L226 Difference]: Without dead ends: 154130 [2019-12-28 03:11:52,265 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 03:11:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154130 states. [2019-12-28 03:11:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154130 to 132942. [2019-12-28 03:11:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132942 states. [2019-12-28 03:11:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132942 states to 132942 states and 585323 transitions. [2019-12-28 03:11:57,662 INFO L78 Accepts]: Start accepts. Automaton has 132942 states and 585323 transitions. Word has length 54 [2019-12-28 03:11:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:11:57,662 INFO L462 AbstractCegarLoop]: Abstraction has 132942 states and 585323 transitions. [2019-12-28 03:11:57,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:11:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 132942 states and 585323 transitions. [2019-12-28 03:11:57,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-28 03:11:57,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:11:57,707 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 03:11:57,707 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 03:11:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:11:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash 904775879, now seen corresponding path program 1 times [2019-12-28 03:11:57,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:11:57,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696632825] [2019-12-28 03:11:57,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:11:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:11:57,775 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 03:11:57,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696632825] [2019-12-28 03:11:57,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:11:57,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:11:57,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689241110] [2019-12-28 03:11:57,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:11:57,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:11:57,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 144 transitions. [2019-12-28 03:11:57,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:11:57,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:11:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:11:57,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:11:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:11:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:11:57,840 INFO L87 Difference]: Start difference. First operand 132942 states and 585323 transitions. Second operand 5 states. [2019-12-28 03:12:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:12:03,725 INFO L93 Difference]: Finished difference Result 171274 states and 741340 transitions. [2019-12-28 03:12:03,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:12:03,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-28 03:12:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:12:04,884 INFO L225 Difference]: With dead ends: 171274 [2019-12-28 03:12:04,884 INFO L226 Difference]: Without dead ends: 171274 [2019-12-28 03:12:04,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:12:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171274 states. [2019-12-28 03:12:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171274 to 151998. [2019-12-28 03:12:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151998 states. [2019-12-28 03:12:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151998 states to 151998 states and 663351 transitions. [2019-12-28 03:12:17,793 INFO L78 Accepts]: Start accepts. Automaton has 151998 states and 663351 transitions. Word has length 56 [2019-12-28 03:12:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:12:17,794 INFO L462 AbstractCegarLoop]: Abstraction has 151998 states and 663351 transitions. [2019-12-28 03:12:17,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:12:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand 151998 states and 663351 transitions. [2019-12-28 03:12:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:12:17,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:12:17,837 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] [2019-12-28 03:12:17,838 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 03:12:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:12:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1544055187, now seen corresponding path program 1 times [2019-12-28 03:12:17,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:12:17,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467878577] [2019-12-28 03:12:17,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:12:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:12:17,977 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 03:12:17,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467878577] [2019-12-28 03:12:17,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:12:17,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:12:17,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426696337] [2019-12-28 03:12:17,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:12:17,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:12:17,995 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 03:12:17,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:12:17,996 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:12:17,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:12:17,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:12:17,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:12:17,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:12:17,997 INFO L87 Difference]: Start difference. First operand 151998 states and 663351 transitions. Second operand 6 states. [2019-12-28 03:12:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:12:25,678 INFO L93 Difference]: Finished difference Result 208582 states and 902701 transitions. [2019-12-28 03:12:25,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:12:25,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 03:12:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:12:26,380 INFO L225 Difference]: With dead ends: 208582 [2019-12-28 03:12:26,380 INFO L226 Difference]: Without dead ends: 205382 [2019-12-28 03:12:26,380 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 03:12:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205382 states. [2019-12-28 03:12:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205382 to 193070. [2019-12-28 03:12:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193070 states. [2019-12-28 03:12:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193070 states to 193070 states and 837871 transitions. [2019-12-28 03:12:32,576 INFO L78 Accepts]: Start accepts. Automaton has 193070 states and 837871 transitions. Word has length 60 [2019-12-28 03:12:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:12:32,577 INFO L462 AbstractCegarLoop]: Abstraction has 193070 states and 837871 transitions. [2019-12-28 03:12:32,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:12:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 193070 states and 837871 transitions. [2019-12-28 03:12:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:12:32,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:12:32,628 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] [2019-12-28 03:12:32,632 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 03:12:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:12:32,633 INFO L82 PathProgramCache]: Analyzing trace with hash -252896172, now seen corresponding path program 1 times [2019-12-28 03:12:32,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:12:32,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288948679] [2019-12-28 03:12:32,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:12:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:12:32,759 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 03:12:32,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288948679] [2019-12-28 03:12:32,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:12:32,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:12:32,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7114094] [2019-12-28 03:12:32,760 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:12:32,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:12:32,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 03:12:32,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:12:32,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:12:32,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:12:32,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:12:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:12:32,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:12:32,777 INFO L87 Difference]: Start difference. First operand 193070 states and 837871 transitions. Second operand 7 states. [2019-12-28 03:12:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:12:45,235 INFO L93 Difference]: Finished difference Result 275526 states and 1157813 transitions. [2019-12-28 03:12:45,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:12:45,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-28 03:12:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:12:46,201 INFO L225 Difference]: With dead ends: 275526 [2019-12-28 03:12:46,201 INFO L226 Difference]: Without dead ends: 275526 [2019-12-28 03:12:46,202 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 03:12:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275526 states. [2019-12-28 03:12:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275526 to 228422. [2019-12-28 03:12:51,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228422 states. [2019-12-28 03:12:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228422 states to 228422 states and 972797 transitions. [2019-12-28 03:12:53,855 INFO L78 Accepts]: Start accepts. Automaton has 228422 states and 972797 transitions. Word has length 60 [2019-12-28 03:12:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:12:53,855 INFO L462 AbstractCegarLoop]: Abstraction has 228422 states and 972797 transitions. [2019-12-28 03:12:53,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:12:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 228422 states and 972797 transitions. [2019-12-28 03:12:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:12:53,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:12:53,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:12:53,906 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 03:12:53,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:12:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 634607509, now seen corresponding path program 1 times [2019-12-28 03:12:53,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:12:53,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412634944] [2019-12-28 03:12:53,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:12:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:12:53,961 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 03:12:53,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412634944] [2019-12-28 03:12:53,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:12:53,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:12:53,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1735986047] [2019-12-28 03:12:53,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:12:53,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:12:53,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 64 transitions. [2019-12-28 03:12:53,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:12:53,978 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:12:53,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:12:53,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:12:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:12:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:12:53,979 INFO L87 Difference]: Start difference. First operand 228422 states and 972797 transitions. Second operand 3 states. [2019-12-28 03:13:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:02,212 INFO L93 Difference]: Finished difference Result 173354 states and 733096 transitions. [2019-12-28 03:13:02,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:13:02,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-28 03:13:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:02,763 INFO L225 Difference]: With dead ends: 173354 [2019-12-28 03:13:02,764 INFO L226 Difference]: Without dead ends: 171338 [2019-12-28 03:13:02,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:13:03,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171338 states. [2019-12-28 03:13:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171338 to 165566. [2019-12-28 03:13:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165566 states. [2019-12-28 03:13:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165566 states to 165566 states and 703139 transitions. [2019-12-28 03:13:08,254 INFO L78 Accepts]: Start accepts. Automaton has 165566 states and 703139 transitions. Word has length 60 [2019-12-28 03:13:08,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:08,254 INFO L462 AbstractCegarLoop]: Abstraction has 165566 states and 703139 transitions. [2019-12-28 03:13:08,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:13:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 165566 states and 703139 transitions. [2019-12-28 03:13:08,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:13:08,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:08,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:13:08,287 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 03:13:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:08,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1393970514, now seen corresponding path program 1 times [2019-12-28 03:13:08,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:08,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684788768] [2019-12-28 03:13:08,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:08,369 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 03:13:08,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684788768] [2019-12-28 03:13:08,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:08,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:13:08,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [93216325] [2019-12-28 03:13:08,371 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:08,379 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:08,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 180 transitions. [2019-12-28 03:13:08,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:08,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:13:08,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:13:08,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:13:08,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:13:08,441 INFO L87 Difference]: Start difference. First operand 165566 states and 703139 transitions. Second operand 8 states. [2019-12-28 03:13:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:16,039 INFO L93 Difference]: Finished difference Result 213322 states and 893756 transitions. [2019-12-28 03:13:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:13:16,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-28 03:13:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:16,727 INFO L225 Difference]: With dead ends: 213322 [2019-12-28 03:13:16,728 INFO L226 Difference]: Without dead ends: 210722 [2019-12-28 03:13:16,728 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 03:13:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210722 states. [2019-12-28 03:13:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210722 to 168522. [2019-12-28 03:13:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168522 states. [2019-12-28 03:13:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168522 states to 168522 states and 716200 transitions. [2019-12-28 03:13:22,545 INFO L78 Accepts]: Start accepts. Automaton has 168522 states and 716200 transitions. Word has length 60 [2019-12-28 03:13:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:22,546 INFO L462 AbstractCegarLoop]: Abstraction has 168522 states and 716200 transitions. [2019-12-28 03:13:22,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:13:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 168522 states and 716200 transitions. [2019-12-28 03:13:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:13:22,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:22,583 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] [2019-12-28 03:13:22,583 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 03:13:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1451186614, now seen corresponding path program 1 times [2019-12-28 03:13:22,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:22,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406368996] [2019-12-28 03:13:22,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:22,719 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 03:13:22,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406368996] [2019-12-28 03:13:22,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:22,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:13:22,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931715915] [2019-12-28 03:13:22,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:22,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:22,735 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:13:22,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:22,736 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:13:22,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:13:22,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:13:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:13:22,737 INFO L87 Difference]: Start difference. First operand 168522 states and 716200 transitions. Second operand 6 states. [2019-12-28 03:13:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:29,419 INFO L93 Difference]: Finished difference Result 219174 states and 906709 transitions. [2019-12-28 03:13:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:13:29,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-28 03:13:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:30,887 INFO L225 Difference]: With dead ends: 219174 [2019-12-28 03:13:30,888 INFO L226 Difference]: Without dead ends: 219174 [2019-12-28 03:13:30,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:13:31,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219174 states. [2019-12-28 03:13:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219174 to 184422. [2019-12-28 03:13:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184422 states. [2019-12-28 03:13:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184422 states to 184422 states and 773977 transitions. [2019-12-28 03:13:37,066 INFO L78 Accepts]: Start accepts. Automaton has 184422 states and 773977 transitions. Word has length 61 [2019-12-28 03:13:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:37,066 INFO L462 AbstractCegarLoop]: Abstraction has 184422 states and 773977 transitions. [2019-12-28 03:13:37,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:13:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 184422 states and 773977 transitions. [2019-12-28 03:13:37,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-28 03:13:37,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:37,112 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] [2019-12-28 03:13:37,112 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 03:13:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1956277001, now seen corresponding path program 1 times [2019-12-28 03:13:37,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:37,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879406383] [2019-12-28 03:13:37,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:37,189 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 03:13:37,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879406383] [2019-12-28 03:13:37,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:37,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:13:37,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [450384035] [2019-12-28 03:13:37,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:37,197 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:37,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 61 transitions. [2019-12-28 03:13:37,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:37,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:13:37,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:13:37,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:37,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:13:37,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:13:37,206 INFO L87 Difference]: Start difference. First operand 184422 states and 773977 transitions. Second operand 4 states. [2019-12-28 03:13:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:38,001 INFO L93 Difference]: Finished difference Result 150711 states and 615558 transitions. [2019-12-28 03:13:38,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:13:38,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-28 03:13:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:45,011 INFO L225 Difference]: With dead ends: 150711 [2019-12-28 03:13:45,011 INFO L226 Difference]: Without dead ends: 145075 [2019-12-28 03:13:45,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:13:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145075 states. [2019-12-28 03:13:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145075 to 145075. [2019-12-28 03:13:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145075 states. [2019-12-28 03:13:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145075 states to 145075 states and 595917 transitions. [2019-12-28 03:13:48,920 INFO L78 Accepts]: Start accepts. Automaton has 145075 states and 595917 transitions. Word has length 61 [2019-12-28 03:13:48,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:48,920 INFO L462 AbstractCegarLoop]: Abstraction has 145075 states and 595917 transitions. [2019-12-28 03:13:48,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:13:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 145075 states and 595917 transitions. [2019-12-28 03:13:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 03:13:48,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:48,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] [2019-12-28 03:13:48,948 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 03:13:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1938339175, now seen corresponding path program 1 times [2019-12-28 03:13:48,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:48,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129874459] [2019-12-28 03:13:48,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:49,026 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 03:13:49,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129874459] [2019-12-28 03:13:49,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:49,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:13:49,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140225533] [2019-12-28 03:13:49,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:49,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:49,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 78 transitions. [2019-12-28 03:13:49,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:49,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:13:49,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:13:49,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:13:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:13:49,066 INFO L87 Difference]: Start difference. First operand 145075 states and 595917 transitions. Second operand 6 states. [2019-12-28 03:13:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:49,262 INFO L93 Difference]: Finished difference Result 26542 states and 98275 transitions. [2019-12-28 03:13:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:13:49,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-28 03:13:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:49,306 INFO L225 Difference]: With dead ends: 26542 [2019-12-28 03:13:49,306 INFO L226 Difference]: Without dead ends: 22036 [2019-12-28 03:13:49,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:13:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22036 states. [2019-12-28 03:13:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22036 to 21844. [2019-12-28 03:13:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21844 states. [2019-12-28 03:13:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21844 states to 21844 states and 79583 transitions. [2019-12-28 03:13:49,684 INFO L78 Accepts]: Start accepts. Automaton has 21844 states and 79583 transitions. Word has length 62 [2019-12-28 03:13:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:49,684 INFO L462 AbstractCegarLoop]: Abstraction has 21844 states and 79583 transitions. [2019-12-28 03:13:49,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:13:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21844 states and 79583 transitions. [2019-12-28 03:13:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 03:13:49,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:49,697 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] [2019-12-28 03:13:49,697 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 03:13:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1157505069, now seen corresponding path program 1 times [2019-12-28 03:13:49,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:49,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755058148] [2019-12-28 03:13:49,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:50,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 03:13:50,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755058148] [2019-12-28 03:13:50,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:50,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:13:50,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528587420] [2019-12-28 03:13:50,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:50,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:50,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 447 transitions. [2019-12-28 03:13:50,765 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:50,790 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:13:50,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:13:50,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:50,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:13:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:13:50,791 INFO L87 Difference]: Start difference. First operand 21844 states and 79583 transitions. Second operand 5 states. [2019-12-28 03:13:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:51,039 INFO L93 Difference]: Finished difference Result 25690 states and 92959 transitions. [2019-12-28 03:13:51,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:13:51,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 03:13:51,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:51,088 INFO L225 Difference]: With dead ends: 25690 [2019-12-28 03:13:51,089 INFO L226 Difference]: Without dead ends: 25690 [2019-12-28 03:13:51,089 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 03:13:51,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25690 states. [2019-12-28 03:13:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25690 to 23602. [2019-12-28 03:13:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23602 states. [2019-12-28 03:13:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23602 states to 23602 states and 85585 transitions. [2019-12-28 03:13:51,481 INFO L78 Accepts]: Start accepts. Automaton has 23602 states and 85585 transitions. Word has length 71 [2019-12-28 03:13:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:51,481 INFO L462 AbstractCegarLoop]: Abstraction has 23602 states and 85585 transitions. [2019-12-28 03:13:51,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:13:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 23602 states and 85585 transitions. [2019-12-28 03:13:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 03:13:51,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:51,493 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] [2019-12-28 03:13:51,494 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 03:13:51,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1394651892, now seen corresponding path program 1 times [2019-12-28 03:13:51,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:51,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427091584] [2019-12-28 03:13:51,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:51,573 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 03:13:51,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427091584] [2019-12-28 03:13:51,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:51,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:13:51,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [326020542] [2019-12-28 03:13:51,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:51,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:51,637 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 447 transitions. [2019-12-28 03:13:51,638 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:51,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:13:51,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:13:51,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:13:51,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:13:51,662 INFO L87 Difference]: Start difference. First operand 23602 states and 85585 transitions. Second operand 7 states. [2019-12-28 03:13:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:52,196 INFO L93 Difference]: Finished difference Result 30238 states and 108458 transitions. [2019-12-28 03:13:52,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:13:52,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-28 03:13:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:52,255 INFO L225 Difference]: With dead ends: 30238 [2019-12-28 03:13:52,255 INFO L226 Difference]: Without dead ends: 30058 [2019-12-28 03:13:52,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:13:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30058 states. [2019-12-28 03:13:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30058 to 26280. [2019-12-28 03:13:54,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26280 states. [2019-12-28 03:13:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26280 states to 26280 states and 94905 transitions. [2019-12-28 03:13:54,799 INFO L78 Accepts]: Start accepts. Automaton has 26280 states and 94905 transitions. Word has length 71 [2019-12-28 03:13:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:54,799 INFO L462 AbstractCegarLoop]: Abstraction has 26280 states and 94905 transitions. [2019-12-28 03:13:54,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:13:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 26280 states and 94905 transitions. [2019-12-28 03:13:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:13:54,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:54,817 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 03:13:54,818 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 03:13:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 2056169279, now seen corresponding path program 1 times [2019-12-28 03:13:54,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:54,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129266454] [2019-12-28 03:13:54,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:54,877 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 03:13:54,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129266454] [2019-12-28 03:13:54,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:54,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:13:54,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2060011504] [2019-12-28 03:13:54,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:54,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:54,913 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 03:13:54,913 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:54,914 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:13:54,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:13:54,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:54,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:13:54,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:13:54,915 INFO L87 Difference]: Start difference. First operand 26280 states and 94905 transitions. Second operand 4 states. [2019-12-28 03:13:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:55,252 INFO L93 Difference]: Finished difference Result 34914 states and 124766 transitions. [2019-12-28 03:13:55,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:13:55,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-28 03:13:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:55,321 INFO L225 Difference]: With dead ends: 34914 [2019-12-28 03:13:55,321 INFO L226 Difference]: Without dead ends: 34914 [2019-12-28 03:13:55,321 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 03:13:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34914 states. [2019-12-28 03:13:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34914 to 29733. [2019-12-28 03:13:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29733 states. [2019-12-28 03:13:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29733 states to 29733 states and 106658 transitions. [2019-12-28 03:13:55,841 INFO L78 Accepts]: Start accepts. Automaton has 29733 states and 106658 transitions. Word has length 75 [2019-12-28 03:13:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:55,841 INFO L462 AbstractCegarLoop]: Abstraction has 29733 states and 106658 transitions. [2019-12-28 03:13:55,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:13:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 29733 states and 106658 transitions. [2019-12-28 03:13:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:13:55,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:55,866 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 03:13:55,866 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 03:13:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash -994033536, now seen corresponding path program 1 times [2019-12-28 03:13:55,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:55,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121042182] [2019-12-28 03:13:55,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:55,971 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 03:13:55,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121042182] [2019-12-28 03:13:55,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:55,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:13:55,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [517538622] [2019-12-28 03:13:55,972 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:55,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:56,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 03:13:56,325 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:56,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:13:56,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:13:56,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:56,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:13:56,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:13:56,330 INFO L87 Difference]: Start difference. First operand 29733 states and 106658 transitions. Second operand 6 states. [2019-12-28 03:13:56,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:56,987 INFO L93 Difference]: Finished difference Result 34478 states and 121687 transitions. [2019-12-28 03:13:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:13:56,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 03:13:56,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:57,053 INFO L225 Difference]: With dead ends: 34478 [2019-12-28 03:13:57,053 INFO L226 Difference]: Without dead ends: 34478 [2019-12-28 03:13:57,054 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 03:13:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34478 states. [2019-12-28 03:13:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34478 to 33413. [2019-12-28 03:13:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33413 states. [2019-12-28 03:13:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33413 states to 33413 states and 118236 transitions. [2019-12-28 03:13:57,610 INFO L78 Accepts]: Start accepts. Automaton has 33413 states and 118236 transitions. Word has length 75 [2019-12-28 03:13:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:57,610 INFO L462 AbstractCegarLoop]: Abstraction has 33413 states and 118236 transitions. [2019-12-28 03:13:57,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:13:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 33413 states and 118236 transitions. [2019-12-28 03:13:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:13:57,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:57,639 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 03:13:57,639 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 03:13:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1223724417, now seen corresponding path program 1 times [2019-12-28 03:13:57,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:57,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003436565] [2019-12-28 03:13:57,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:57,755 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 03:13:57,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003436565] [2019-12-28 03:13:57,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:57,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:13:57,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [926015376] [2019-12-28 03:13:57,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:57,770 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:57,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 03:13:57,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:57,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:13:57,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:13:57,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:13:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:13:57,799 INFO L87 Difference]: Start difference. First operand 33413 states and 118236 transitions. Second operand 6 states. [2019-12-28 03:13:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:58,385 INFO L93 Difference]: Finished difference Result 39881 states and 137564 transitions. [2019-12-28 03:13:58,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:13:58,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-28 03:13:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:13:58,841 INFO L225 Difference]: With dead ends: 39881 [2019-12-28 03:13:58,842 INFO L226 Difference]: Without dead ends: 39881 [2019-12-28 03:13:58,842 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 03:13:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39881 states. [2019-12-28 03:13:59,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39881 to 34241. [2019-12-28 03:13:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34241 states. [2019-12-28 03:13:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34241 states to 34241 states and 119102 transitions. [2019-12-28 03:13:59,408 INFO L78 Accepts]: Start accepts. Automaton has 34241 states and 119102 transitions. Word has length 75 [2019-12-28 03:13:59,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:13:59,408 INFO L462 AbstractCegarLoop]: Abstraction has 34241 states and 119102 transitions. [2019-12-28 03:13:59,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:13:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34241 states and 119102 transitions. [2019-12-28 03:13:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:13:59,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:13:59,436 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 03:13:59,436 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 03:13:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:13:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1435075330, now seen corresponding path program 1 times [2019-12-28 03:13:59,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:13:59,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903692473] [2019-12-28 03:13:59,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:13:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:13:59,506 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 03:13:59,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903692473] [2019-12-28 03:13:59,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:13:59,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:13:59,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388438606] [2019-12-28 03:13:59,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:13:59,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:13:59,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 03:13:59,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:13:59,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:13:59,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:13:59,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:13:59,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:13:59,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:13:59,545 INFO L87 Difference]: Start difference. First operand 34241 states and 119102 transitions. Second operand 5 states. [2019-12-28 03:13:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:13:59,948 INFO L93 Difference]: Finished difference Result 41646 states and 144386 transitions. [2019-12-28 03:13:59,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:13:59,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 03:13:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:14:00,027 INFO L225 Difference]: With dead ends: 41646 [2019-12-28 03:14:00,027 INFO L226 Difference]: Without dead ends: 41646 [2019-12-28 03:14:00,028 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 03:14:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41646 states. [2019-12-28 03:14:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41646 to 36963. [2019-12-28 03:14:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36963 states. [2019-12-28 03:14:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36963 states to 36963 states and 127705 transitions. [2019-12-28 03:14:00,931 INFO L78 Accepts]: Start accepts. Automaton has 36963 states and 127705 transitions. Word has length 75 [2019-12-28 03:14:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:14:00,932 INFO L462 AbstractCegarLoop]: Abstraction has 36963 states and 127705 transitions. [2019-12-28 03:14:00,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:14:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 36963 states and 127705 transitions. [2019-12-28 03:14:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:14:00,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:14:00,962 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 03:14:00,962 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 03:14:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:14:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash 924541153, now seen corresponding path program 1 times [2019-12-28 03:14:00,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:14:00,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664787849] [2019-12-28 03:14:00,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:14:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:14:01,023 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 03:14:01,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664787849] [2019-12-28 03:14:01,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:14:01,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:14:01,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [585576592] [2019-12-28 03:14:01,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:14:01,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:14:01,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 03:14:01,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:14:01,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:14:01,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:14:01,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:14:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:14:01,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:14:01,067 INFO L87 Difference]: Start difference. First operand 36963 states and 127705 transitions. Second operand 4 states. [2019-12-28 03:14:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:14:01,768 INFO L93 Difference]: Finished difference Result 44712 states and 154912 transitions. [2019-12-28 03:14:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:14:01,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-28 03:14:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:14:01,853 INFO L225 Difference]: With dead ends: 44712 [2019-12-28 03:14:01,853 INFO L226 Difference]: Without dead ends: 43569 [2019-12-28 03:14:01,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 03:14:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43569 states. [2019-12-28 03:14:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43569 to 41922. [2019-12-28 03:14:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41922 states. [2019-12-28 03:14:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41922 states to 41922 states and 144883 transitions. [2019-12-28 03:14:02,958 INFO L78 Accepts]: Start accepts. Automaton has 41922 states and 144883 transitions. Word has length 75 [2019-12-28 03:14:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:14:02,958 INFO L462 AbstractCegarLoop]: Abstraction has 41922 states and 144883 transitions. [2019-12-28 03:14:02,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:14:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 41922 states and 144883 transitions. [2019-12-28 03:14:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:14:02,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:14:02,991 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 03:14:02,991 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 03:14:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:14:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash -872410206, now seen corresponding path program 1 times [2019-12-28 03:14:02,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:14:02,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806471133] [2019-12-28 03:14:02,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:14:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:14:03,074 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 03:14:03,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806471133] [2019-12-28 03:14:03,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:14:03,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:14:03,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [490990896] [2019-12-28 03:14:03,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:14:03,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:14:03,108 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 03:14:03,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:14:03,109 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:14:03,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:14:03,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:14:03,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:14:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:14:03,110 INFO L87 Difference]: Start difference. First operand 41922 states and 144883 transitions. Second operand 5 states. [2019-12-28 03:14:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:14:03,384 INFO L93 Difference]: Finished difference Result 40869 states and 138502 transitions. [2019-12-28 03:14:03,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:14:03,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 03:14:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:14:03,464 INFO L225 Difference]: With dead ends: 40869 [2019-12-28 03:14:03,464 INFO L226 Difference]: Without dead ends: 40869 [2019-12-28 03:14:03,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:14:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40869 states. [2019-12-28 03:14:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40869 to 32163. [2019-12-28 03:14:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32163 states. [2019-12-28 03:14:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32163 states to 32163 states and 109074 transitions. [2019-12-28 03:14:04,015 INFO L78 Accepts]: Start accepts. Automaton has 32163 states and 109074 transitions. Word has length 75 [2019-12-28 03:14:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:14:04,015 INFO L462 AbstractCegarLoop]: Abstraction has 32163 states and 109074 transitions. [2019-12-28 03:14:04,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:14:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32163 states and 109074 transitions. [2019-12-28 03:14:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 03:14:04,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:14:04,038 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 03:14:04,039 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 03:14:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:14:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash 15093475, now seen corresponding path program 1 times [2019-12-28 03:14:04,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:14:04,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247136848] [2019-12-28 03:14:04,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:14:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:14:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:14:04,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247136848] [2019-12-28 03:14:04,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:14:04,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:14:04,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95786047] [2019-12-28 03:14:04,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:14:04,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:14:04,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 95 transitions. [2019-12-28 03:14:04,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:14:04,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:14:04,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:14:04,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:14:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:14:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:14:04,186 INFO L87 Difference]: Start difference. First operand 32163 states and 109074 transitions. Second operand 7 states. [2019-12-28 03:14:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:14:04,328 INFO L93 Difference]: Finished difference Result 13182 states and 40467 transitions. [2019-12-28 03:14:04,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:14:04,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 03:14:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:14:04,352 INFO L225 Difference]: With dead ends: 13182 [2019-12-28 03:14:04,352 INFO L226 Difference]: Without dead ends: 11579 [2019-12-28 03:14:04,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:14:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11579 states. [2019-12-28 03:14:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11579 to 10863. [2019-12-28 03:14:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10863 states. [2019-12-28 03:14:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10863 states to 10863 states and 33106 transitions. [2019-12-28 03:14:04,731 INFO L78 Accepts]: Start accepts. Automaton has 10863 states and 33106 transitions. Word has length 75 [2019-12-28 03:14:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:14:04,731 INFO L462 AbstractCegarLoop]: Abstraction has 10863 states and 33106 transitions. [2019-12-28 03:14:04,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:14:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10863 states and 33106 transitions. [2019-12-28 03:14:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 03:14:04,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:14:04,744 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 03:14:04,745 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 03:14:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:14:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1476908944, now seen corresponding path program 1 times [2019-12-28 03:14:04,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:14:04,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705192657] [2019-12-28 03:14:04,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:14:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:14:04,846 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 03:14:04,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705192657] [2019-12-28 03:14:04,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:14:04,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:14:04,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1917175967] [2019-12-28 03:14:04,848 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:14:04,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:14:04,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 205 transitions. [2019-12-28 03:14:04,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:14:05,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-28 03:14:05,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:14:05,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:14:05,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:14:05,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:14:05,014 INFO L87 Difference]: Start difference. First operand 10863 states and 33106 transitions. Second operand 11 states. [2019-12-28 03:14:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:14:06,642 INFO L93 Difference]: Finished difference Result 16541 states and 49584 transitions. [2019-12-28 03:14:06,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-28 03:14:06,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-12-28 03:14:06,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:14:06,682 INFO L225 Difference]: With dead ends: 16541 [2019-12-28 03:14:06,682 INFO L226 Difference]: Without dead ends: 16421 [2019-12-28 03:14:06,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-12-28 03:14:06,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16421 states. [2019-12-28 03:14:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16421 to 13503. [2019-12-28 03:14:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13503 states. [2019-12-28 03:14:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13503 states to 13503 states and 40722 transitions. [2019-12-28 03:14:07,064 INFO L78 Accepts]: Start accepts. Automaton has 13503 states and 40722 transitions. Word has length 92 [2019-12-28 03:14:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:14:07,065 INFO L462 AbstractCegarLoop]: Abstraction has 13503 states and 40722 transitions. [2019-12-28 03:14:07,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:14:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 13503 states and 40722 transitions. [2019-12-28 03:14:07,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 03:14:07,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:14:07,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:14:07,093 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 03:14:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:14:07,093 INFO L82 PathProgramCache]: Analyzing trace with hash 740849009, now seen corresponding path program 1 times [2019-12-28 03:14:07,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:14:07,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7280116] [2019-12-28 03:14:07,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:14:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:14:07,340 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 03:14:07,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7280116] [2019-12-28 03:14:07,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:14:07,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:14:07,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448969459] [2019-12-28 03:14:07,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:14:07,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:14:07,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 150 states and 205 transitions. [2019-12-28 03:14:07,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:14:07,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:14:07,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:14:07,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:14:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:14:07,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:14:07,475 INFO L87 Difference]: Start difference. First operand 13503 states and 40722 transitions. Second operand 9 states. [2019-12-28 03:14:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:14:07,853 INFO L93 Difference]: Finished difference Result 30984 states and 92318 transitions. [2019-12-28 03:14:07,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:14:07,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-12-28 03:14:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:14:07,897 INFO L225 Difference]: With dead ends: 30984 [2019-12-28 03:14:07,897 INFO L226 Difference]: Without dead ends: 17682 [2019-12-28 03:14:07,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:14:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17682 states. [2019-12-28 03:14:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17682 to 11703. [2019-12-28 03:14:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11703 states. [2019-12-28 03:14:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11703 states to 11703 states and 34976 transitions. [2019-12-28 03:14:08,249 INFO L78 Accepts]: Start accepts. Automaton has 11703 states and 34976 transitions. Word has length 92 [2019-12-28 03:14:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:14:08,249 INFO L462 AbstractCegarLoop]: Abstraction has 11703 states and 34976 transitions. [2019-12-28 03:14:08,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:14:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 11703 states and 34976 transitions. [2019-12-28 03:14:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-28 03:14:08,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:14:08,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:14:08,273 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 03:14:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:14:08,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1996610215, now seen corresponding path program 2 times [2019-12-28 03:14:08,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:14:08,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460809709] [2019-12-28 03:14:08,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:14:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:14:08,516 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 03:14:08,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460809709] [2019-12-28 03:14:08,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:14:08,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:14:08,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [585544512] [2019-12-28 03:14:08,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:14:08,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:14:08,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 294 transitions. [2019-12-28 03:14:08,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:14:08,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:14:08,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:14:08,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:14:08,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:14:08,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:14:08,701 INFO L87 Difference]: Start difference. First operand 11703 states and 34976 transitions. Second operand 11 states. Received shutdown request... [2019-12-28 03:14:08,792 WARN L209 SmtUtils]: Removed 1 from assertion stack [2019-12-28 03:14:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:14:08,793 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-28 03:14:08,799 WARN L227 ceAbstractionStarter]: Timeout [2019-12-28 03:14:08,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:14:08 BasicIcfg [2019-12-28 03:14:08,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:14:08,802 INFO L168 Benchmark]: Toolchain (without parser) took 185452.04 ms. Allocated memory was 138.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 102.4 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 802.5 MB. Max. memory is 7.1 GB. [2019-12-28 03:14:08,802 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-28 03:14:08,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.95 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 158.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-28 03:14:08,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.29 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:14:08,804 INFO L168 Benchmark]: Boogie Preprocessor took 36.83 ms. Allocated memory is still 203.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-28 03:14:08,804 INFO L168 Benchmark]: RCFGBuilder took 811.36 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 109.5 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:14:08,810 INFO L168 Benchmark]: TraceAbstraction took 183729.32 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 109.5 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 745.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:14:08,814 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.95 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 158.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.29 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 155.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.83 ms. Allocated memory is still 203.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.36 ms. Allocated memory is still 203.4 MB. Free memory was 152.7 MB in the beginning and 109.5 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 183729.32 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 109.5 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 745.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (11703states) and FLOYD_HOARE automaton (currently 6 states, 11 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (11703states) and FLOYD_HOARE automaton (currently 6 states, 11 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: TIMEOUT, OverallTime: 183.5s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 85.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6144 SDtfs, 9251 SDslu, 14248 SDs, 0 SdLazy, 5244 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228422occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 72.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 231713 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1575 NumberOfCodeBlocks, 1575 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1552 ConstructedInterpolants, 0 QuantifiedInterpolants, 302503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown