/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:00:24,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:00:24,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:00:24,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:00:24,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:00:24,150 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:00:24,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:00:24,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:00:24,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:00:24,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:00:24,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:00:24,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:00:24,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:00:24,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:00:24,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:00:24,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:00:24,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:00:24,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:00:24,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:00:24,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:00:24,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:00:24,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:00:24,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:00:24,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:00:24,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:00:24,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:00:24,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:00:24,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:00:24,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:00:24,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:00:24,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:00:24,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:00:24,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:00:24,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:00:24,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:00:24,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:00:24,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:00:24,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:00:24,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:00:24,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:00:24,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:00:24,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:00:24,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:00:24,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:00:24,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:00:24,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:00:24,220 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:00:24,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:00:24,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:00:24,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:00:24,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:00:24,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:00:24,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:00:24,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:00:24,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:00:24,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:00:24,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:00:24,224 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:00:24,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:00:24,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:00:24,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:00:24,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:00:24,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:00:24,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:00:24,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:00:24,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:00:24,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:00:24,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:00:24,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:00:24,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:00:24,226 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:00:24,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:00:24,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:00:24,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:00:24,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:00:24,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:00:24,516 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:00:24,517 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-18 15:00:24,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd137c544/9c5d46bd48b64729b5b1b507b2f52e7f/FLAG22b5e6bca [2019-12-18 15:00:25,123 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:00:25,124 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_power.opt.i [2019-12-18 15:00:25,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd137c544/9c5d46bd48b64729b5b1b507b2f52e7f/FLAG22b5e6bca [2019-12-18 15:00:25,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd137c544/9c5d46bd48b64729b5b1b507b2f52e7f [2019-12-18 15:00:25,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:00:25,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:00:25,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:00:25,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:00:25,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:00:25,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:00:25" (1/1) ... [2019-12-18 15:00:25,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ce1bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:25, skipping insertion in model container [2019-12-18 15:00:25,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:00:25" (1/1) ... [2019-12-18 15:00:25,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:00:25,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:00:26,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:00:26,075 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:00:26,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:00:26,241 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:00:26,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26 WrapperNode [2019-12-18 15:00:26,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:00:26,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:00:26,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:00:26,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:00:26,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:00:26,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:00:26,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:00:26,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:00:26,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (1/1) ... [2019-12-18 15:00:26,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:00:26,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:00:26,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:00:26,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:00:26,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (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-18 15:00:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:00:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:00:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:00:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:00:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:00:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:00:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:00:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:00:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:00:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:00:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:00:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:00:26,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:00:26,438 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:00:27,162 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:00:27,162 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:00:27,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:00:27 BoogieIcfgContainer [2019-12-18 15:00:27,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:00:27,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:00:27,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:00:27,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:00:27,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:00:25" (1/3) ... [2019-12-18 15:00:27,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152e5c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:00:27, skipping insertion in model container [2019-12-18 15:00:27,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:00:26" (2/3) ... [2019-12-18 15:00:27,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152e5c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:00:27, skipping insertion in model container [2019-12-18 15:00:27,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:00:27" (3/3) ... [2019-12-18 15:00:27,175 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.opt.i [2019-12-18 15:00:27,186 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:00:27,186 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:00:27,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:00:27,199 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:00:27,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,262 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,263 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,295 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,295 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,351 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,352 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,355 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,356 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:00:27,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:00:27,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:00:27,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:00:27,407 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:00:27,407 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:00:27,407 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:00:27,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:00:27,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:00:27,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:00:27,423 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 15:00:27,425 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 15:00:27,512 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 15:00:27,512 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:00:27,531 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 15:00:27,560 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 15:00:27,611 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 15:00:27,611 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:00:27,620 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 15:00:27,642 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 15:00:27,643 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:00:32,578 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 15:00:32,704 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 15:00:33,051 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:00:33,165 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 15:00:33,186 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-18 15:00:33,186 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 15:00:33,189 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-18 15:00:48,294 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-18 15:00:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-18 15:00:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:00:48,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:00:48,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:00:48,304 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:00:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:00:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-18 15:00:48,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:00:48,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285598876] [2019-12-18 15:00:48,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:00:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:00:48,532 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-18 15:00:48,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285598876] [2019-12-18 15:00:48,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:00:48,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:00:48,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442181643] [2019-12-18 15:00:48,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:00:48,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:00:48,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:00:48,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:48,557 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-18 15:00:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:00:51,406 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-18 15:00:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:00:51,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:00:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:00:52,131 INFO L225 Difference]: With dead ends: 108680 [2019-12-18 15:00:52,132 INFO L226 Difference]: Without dead ends: 102440 [2019-12-18 15:00:52,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:00:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-18 15:01:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-18 15:01:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-18 15:01:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-18 15:01:03,087 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-18 15:01:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:03,088 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-18 15:01:03,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:01:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-18 15:01:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:01:03,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:03,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:03,093 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:01:03,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-18 15:01:03,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:03,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302182365] [2019-12-18 15:01:03,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:03,239 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-18 15:01:03,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302182365] [2019-12-18 15:01:03,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:03,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:01:03,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388525367] [2019-12-18 15:01:03,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:01:03,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:01:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:01:03,243 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-18 15:01:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:01:08,621 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-18 15:01:08,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:01:08,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:01:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:01:09,099 INFO L225 Difference]: With dead ends: 163248 [2019-12-18 15:01:09,100 INFO L226 Difference]: Without dead ends: 163199 [2019-12-18 15:01:09,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:01:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-18 15:01:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-18 15:01:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-18 15:01:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-18 15:01:18,390 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-18 15:01:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:18,391 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-18 15:01:18,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:01:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-18 15:01:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:01:18,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:18,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:18,397 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:01:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:18,398 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-18 15:01:18,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:18,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250892597] [2019-12-18 15:01:18,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:18,533 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-18 15:01:18,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250892597] [2019-12-18 15:01:18,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:18,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:01:18,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232703593] [2019-12-18 15:01:18,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:01:18,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:01:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:01:18,536 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-18 15:01:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:01:25,545 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-18 15:01:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:01:25,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:01:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:01:26,344 INFO L225 Difference]: With dead ends: 208779 [2019-12-18 15:01:26,344 INFO L226 Difference]: Without dead ends: 208723 [2019-12-18 15:01:26,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:01:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-18 15:01:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-18 15:01:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-18 15:01:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-18 15:01:35,678 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-18 15:01:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:35,679 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-18 15:01:35,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:01:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-18 15:01:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:01:35,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:35,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:35,690 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:01:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-18 15:01:35,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:35,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302498888] [2019-12-18 15:01:35,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:35,790 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-18 15:01:35,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302498888] [2019-12-18 15:01:35,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:35,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:01:35,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256886236] [2019-12-18 15:01:35,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:01:35,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:35,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:01:35,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:01:35,792 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-18 15:01:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:01:42,830 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-18 15:01:42,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:01:42,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 15:01:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:01:43,636 INFO L225 Difference]: With dead ends: 234922 [2019-12-18 15:01:43,637 INFO L226 Difference]: Without dead ends: 234922 [2019-12-18 15:01:43,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:01:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-18 15:01:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-18 15:01:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-18 15:01:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-18 15:01:59,575 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-18 15:01:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:01:59,576 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-18 15:01:59,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:01:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-18 15:01:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:01:59,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:01:59,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:01:59,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:01:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:01:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-18 15:01:59,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:01:59,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631900950] [2019-12-18 15:01:59,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:01:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:01:59,652 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-18 15:01:59,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631900950] [2019-12-18 15:01:59,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:01:59,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:01:59,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354893531] [2019-12-18 15:01:59,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:01:59,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:01:59,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:01:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:01:59,655 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 3 states. [2019-12-18 15:02:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:01,993 INFO L93 Difference]: Finished difference Result 195126 states and 800046 transitions. [2019-12-18 15:02:01,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:02:01,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 15:02:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:02,609 INFO L225 Difference]: With dead ends: 195126 [2019-12-18 15:02:02,609 INFO L226 Difference]: Without dead ends: 195126 [2019-12-18 15:02:02,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195126 states. [2019-12-18 15:02:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195126 to 195126. [2019-12-18 15:02:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195126 states. [2019-12-18 15:02:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195126 states to 195126 states and 800046 transitions. [2019-12-18 15:02:18,516 INFO L78 Accepts]: Start accepts. Automaton has 195126 states and 800046 transitions. Word has length 18 [2019-12-18 15:02:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:18,516 INFO L462 AbstractCegarLoop]: Abstraction has 195126 states and 800046 transitions. [2019-12-18 15:02:18,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:02:18,516 INFO L276 IsEmpty]: Start isEmpty. Operand 195126 states and 800046 transitions. [2019-12-18 15:02:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:02:18,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:18,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:18,533 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:18,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:18,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1951188865, now seen corresponding path program 1 times [2019-12-18 15:02:18,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:18,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004203469] [2019-12-18 15:02:18,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:18,597 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-18 15:02:18,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004203469] [2019-12-18 15:02:18,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:18,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:02:18,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588411149] [2019-12-18 15:02:18,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:02:18,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:18,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:02:18,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:02:18,599 INFO L87 Difference]: Start difference. First operand 195126 states and 800046 transitions. Second operand 4 states. [2019-12-18 15:02:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:29,002 INFO L93 Difference]: Finished difference Result 367409 states and 1507754 transitions. [2019-12-18 15:02:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:02:29,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 15:02:29,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:29,688 INFO L225 Difference]: With dead ends: 367409 [2019-12-18 15:02:29,688 INFO L226 Difference]: Without dead ends: 208324 [2019-12-18 15:02:29,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-18 15:02:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208324 states. [2019-12-18 15:02:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208324 to 206903. [2019-12-18 15:02:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206903 states. [2019-12-18 15:02:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206903 states to 206903 states and 837795 transitions. [2019-12-18 15:02:39,779 INFO L78 Accepts]: Start accepts. Automaton has 206903 states and 837795 transitions. Word has length 19 [2019-12-18 15:02:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:39,779 INFO L462 AbstractCegarLoop]: Abstraction has 206903 states and 837795 transitions. [2019-12-18 15:02:39,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:02:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 206903 states and 837795 transitions. [2019-12-18 15:02:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:02:39,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:39,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:39,798 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:39,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2060703810, now seen corresponding path program 1 times [2019-12-18 15:02:39,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:39,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732995723] [2019-12-18 15:02:39,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:39,897 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-18 15:02:39,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732995723] [2019-12-18 15:02:39,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:39,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:02:39,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126414719] [2019-12-18 15:02:39,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:02:39,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:39,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:02:39,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:02:39,899 INFO L87 Difference]: Start difference. First operand 206903 states and 837795 transitions. Second operand 4 states. [2019-12-18 15:02:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:40,128 INFO L93 Difference]: Finished difference Result 53084 states and 178612 transitions. [2019-12-18 15:02:40,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:02:40,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 15:02:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:40,214 INFO L225 Difference]: With dead ends: 53084 [2019-12-18 15:02:40,214 INFO L226 Difference]: Without dead ends: 41205 [2019-12-18 15:02:40,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41205 states. [2019-12-18 15:02:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41205 to 40210. [2019-12-18 15:02:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40210 states. [2019-12-18 15:02:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40210 states to 40210 states and 128989 transitions. [2019-12-18 15:02:46,714 INFO L78 Accepts]: Start accepts. Automaton has 40210 states and 128989 transitions. Word has length 19 [2019-12-18 15:02:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:46,714 INFO L462 AbstractCegarLoop]: Abstraction has 40210 states and 128989 transitions. [2019-12-18 15:02:46,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:02:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 40210 states and 128989 transitions. [2019-12-18 15:02:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:02:46,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:46,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:46,720 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:46,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-18 15:02:46,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:46,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934254004] [2019-12-18 15:02:46,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:46,833 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-18 15:02:46,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934254004] [2019-12-18 15:02:46,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:46,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:02:46,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298708582] [2019-12-18 15:02:46,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:02:46,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:46,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:02:46,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:46,835 INFO L87 Difference]: Start difference. First operand 40210 states and 128989 transitions. Second operand 6 states. [2019-12-18 15:02:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:47,819 INFO L93 Difference]: Finished difference Result 60602 states and 188612 transitions. [2019-12-18 15:02:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:02:47,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:02:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:47,919 INFO L225 Difference]: With dead ends: 60602 [2019-12-18 15:02:47,919 INFO L226 Difference]: Without dead ends: 60504 [2019-12-18 15:02:47,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:02:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60504 states. [2019-12-18 15:02:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60504 to 40348. [2019-12-18 15:02:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40348 states. [2019-12-18 15:02:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40348 states to 40348 states and 128423 transitions. [2019-12-18 15:02:49,109 INFO L78 Accepts]: Start accepts. Automaton has 40348 states and 128423 transitions. Word has length 22 [2019-12-18 15:02:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:49,110 INFO L462 AbstractCegarLoop]: Abstraction has 40348 states and 128423 transitions. [2019-12-18 15:02:49,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:02:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40348 states and 128423 transitions. [2019-12-18 15:02:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:02:49,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:49,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:49,120 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:49,121 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-18 15:02:49,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:49,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750898541] [2019-12-18 15:02:49,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:49,353 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-18 15:02:49,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750898541] [2019-12-18 15:02:49,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:49,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:49,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124988199] [2019-12-18 15:02:49,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:02:49,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:02:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:02:49,355 INFO L87 Difference]: Start difference. First operand 40348 states and 128423 transitions. Second operand 7 states. [2019-12-18 15:02:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:50,141 INFO L93 Difference]: Finished difference Result 56186 states and 174944 transitions. [2019-12-18 15:02:50,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:02:50,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 15:02:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:50,237 INFO L225 Difference]: With dead ends: 56186 [2019-12-18 15:02:50,237 INFO L226 Difference]: Without dead ends: 55974 [2019-12-18 15:02:50,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:02:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55974 states. [2019-12-18 15:02:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55974 to 47425. [2019-12-18 15:02:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47425 states. [2019-12-18 15:02:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47425 states to 47425 states and 150377 transitions. [2019-12-18 15:02:51,110 INFO L78 Accepts]: Start accepts. Automaton has 47425 states and 150377 transitions. Word has length 25 [2019-12-18 15:02:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:51,111 INFO L462 AbstractCegarLoop]: Abstraction has 47425 states and 150377 transitions. [2019-12-18 15:02:51,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:02:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 47425 states and 150377 transitions. [2019-12-18 15:02:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:02:51,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:51,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:51,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-18 15:02:51,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:51,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600357397] [2019-12-18 15:02:51,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:51,234 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-18 15:02:51,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600357397] [2019-12-18 15:02:51,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:51,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:02:51,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802143185] [2019-12-18 15:02:51,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:02:51,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:02:51,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:51,236 INFO L87 Difference]: Start difference. First operand 47425 states and 150377 transitions. Second operand 6 states. [2019-12-18 15:02:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:52,311 INFO L93 Difference]: Finished difference Result 66982 states and 207084 transitions. [2019-12-18 15:02:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:02:52,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 15:02:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:52,428 INFO L225 Difference]: With dead ends: 66982 [2019-12-18 15:02:52,428 INFO L226 Difference]: Without dead ends: 66389 [2019-12-18 15:02:52,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:02:52,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66389 states. [2019-12-18 15:02:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66389 to 52066. [2019-12-18 15:02:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52066 states. [2019-12-18 15:02:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52066 states to 52066 states and 164051 transitions. [2019-12-18 15:02:53,471 INFO L78 Accepts]: Start accepts. Automaton has 52066 states and 164051 transitions. Word has length 27 [2019-12-18 15:02:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:53,472 INFO L462 AbstractCegarLoop]: Abstraction has 52066 states and 164051 transitions. [2019-12-18 15:02:53,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:02:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 52066 states and 164051 transitions. [2019-12-18 15:02:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:02:53,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:53,933 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] [2019-12-18 15:02:53,933 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash -524022794, now seen corresponding path program 1 times [2019-12-18 15:02:53,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:53,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141323297] [2019-12-18 15:02:53,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:54,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141323297] [2019-12-18 15:02:54,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:54,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:02:54,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197370848] [2019-12-18 15:02:54,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:02:54,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:54,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:02:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:02:54,005 INFO L87 Difference]: Start difference. First operand 52066 states and 164051 transitions. Second operand 4 states. [2019-12-18 15:02:54,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:54,561 INFO L93 Difference]: Finished difference Result 118270 states and 380880 transitions. [2019-12-18 15:02:54,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:02:54,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-18 15:02:54,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:54,626 INFO L225 Difference]: With dead ends: 118270 [2019-12-18 15:02:54,627 INFO L226 Difference]: Without dead ends: 28049 [2019-12-18 15:02:54,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28049 states. [2019-12-18 15:02:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28049 to 27357. [2019-12-18 15:02:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27357 states. [2019-12-18 15:02:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27357 states to 27357 states and 84690 transitions. [2019-12-18 15:02:55,117 INFO L78 Accepts]: Start accepts. Automaton has 27357 states and 84690 transitions. Word has length 29 [2019-12-18 15:02:55,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:55,118 INFO L462 AbstractCegarLoop]: Abstraction has 27357 states and 84690 transitions. [2019-12-18 15:02:55,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:02:55,118 INFO L276 IsEmpty]: Start isEmpty. Operand 27357 states and 84690 transitions. [2019-12-18 15:02:55,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:02:55,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:55,133 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] [2019-12-18 15:02:55,133 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:55,133 INFO L82 PathProgramCache]: Analyzing trace with hash -116284186, now seen corresponding path program 1 times [2019-12-18 15:02:55,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:55,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217204443] [2019-12-18 15:02:55,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:55,204 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-18 15:02:55,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217204443] [2019-12-18 15:02:55,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:55,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:55,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082649678] [2019-12-18 15:02:55,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:02:55,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:55,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:02:55,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:55,206 INFO L87 Difference]: Start difference. First operand 27357 states and 84690 transitions. Second operand 5 states. [2019-12-18 15:02:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:55,921 INFO L93 Difference]: Finished difference Result 41160 states and 127027 transitions. [2019-12-18 15:02:55,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:02:55,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 15:02:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:55,992 INFO L225 Difference]: With dead ends: 41160 [2019-12-18 15:02:55,993 INFO L226 Difference]: Without dead ends: 41160 [2019-12-18 15:02:55,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41160 states. [2019-12-18 15:02:56,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41160 to 36991. [2019-12-18 15:02:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36991 states. [2019-12-18 15:02:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36991 states to 36991 states and 114873 transitions. [2019-12-18 15:02:56,849 INFO L78 Accepts]: Start accepts. Automaton has 36991 states and 114873 transitions. Word has length 30 [2019-12-18 15:02:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:56,849 INFO L462 AbstractCegarLoop]: Abstraction has 36991 states and 114873 transitions. [2019-12-18 15:02:56,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:02:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 36991 states and 114873 transitions. [2019-12-18 15:02:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:02:56,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:56,867 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] [2019-12-18 15:02:56,867 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:56,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1132903455, now seen corresponding path program 1 times [2019-12-18 15:02:56,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:56,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989942879] [2019-12-18 15:02:56,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:56,927 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-18 15:02:56,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989942879] [2019-12-18 15:02:56,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:56,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:02:56,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114357943] [2019-12-18 15:02:56,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:02:56,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:56,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:02:56,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:56,930 INFO L87 Difference]: Start difference. First operand 36991 states and 114873 transitions. Second operand 3 states. [2019-12-18 15:02:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:57,048 INFO L93 Difference]: Finished difference Result 36991 states and 113512 transitions. [2019-12-18 15:02:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:02:57,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 15:02:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:57,101 INFO L225 Difference]: With dead ends: 36991 [2019-12-18 15:02:57,101 INFO L226 Difference]: Without dead ends: 36991 [2019-12-18 15:02:57,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36991 states. [2019-12-18 15:02:57,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36991 to 36827. [2019-12-18 15:02:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36827 states. [2019-12-18 15:02:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36827 states to 36827 states and 113045 transitions. [2019-12-18 15:02:57,667 INFO L78 Accepts]: Start accepts. Automaton has 36827 states and 113045 transitions. Word has length 30 [2019-12-18 15:02:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:57,667 INFO L462 AbstractCegarLoop]: Abstraction has 36827 states and 113045 transitions. [2019-12-18 15:02:57,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:02:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 36827 states and 113045 transitions. [2019-12-18 15:02:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:02:57,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:57,683 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] [2019-12-18 15:02:57,683 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1026319235, now seen corresponding path program 1 times [2019-12-18 15:02:57,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:57,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11843145] [2019-12-18 15:02:57,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:57,766 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-18 15:02:57,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11843145] [2019-12-18 15:02:57,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:57,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:02:57,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114971218] [2019-12-18 15:02:57,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:02:57,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:57,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:02:57,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:02:57,769 INFO L87 Difference]: Start difference. First operand 36827 states and 113045 transitions. Second operand 5 states. [2019-12-18 15:02:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:57,864 INFO L93 Difference]: Finished difference Result 17376 states and 50216 transitions. [2019-12-18 15:02:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:02:57,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 15:02:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:57,885 INFO L225 Difference]: With dead ends: 17376 [2019-12-18 15:02:57,885 INFO L226 Difference]: Without dead ends: 15234 [2019-12-18 15:02:57,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:02:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15234 states. [2019-12-18 15:02:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15234 to 14337. [2019-12-18 15:02:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14337 states. [2019-12-18 15:02:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14337 states to 14337 states and 41539 transitions. [2019-12-18 15:02:58,324 INFO L78 Accepts]: Start accepts. Automaton has 14337 states and 41539 transitions. Word has length 31 [2019-12-18 15:02:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:58,324 INFO L462 AbstractCegarLoop]: Abstraction has 14337 states and 41539 transitions. [2019-12-18 15:02:58,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:02:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14337 states and 41539 transitions. [2019-12-18 15:02:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 15:02:58,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:58,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:58,335 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:58,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-18 15:02:58,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:58,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397610897] [2019-12-18 15:02:58,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:58,428 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-18 15:02:58,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397610897] [2019-12-18 15:02:58,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:58,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:58,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553226899] [2019-12-18 15:02:58,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:02:58,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:02:58,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:02:58,430 INFO L87 Difference]: Start difference. First operand 14337 states and 41539 transitions. Second operand 7 states. [2019-12-18 15:02:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:59,155 INFO L93 Difference]: Finished difference Result 15641 states and 44386 transitions. [2019-12-18 15:02:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:02:59,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 15:02:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:59,188 INFO L225 Difference]: With dead ends: 15641 [2019-12-18 15:02:59,188 INFO L226 Difference]: Without dead ends: 14954 [2019-12-18 15:02:59,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:02:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14954 states. [2019-12-18 15:02:59,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14954 to 13282. [2019-12-18 15:02:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13282 states. [2019-12-18 15:02:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13282 states to 13282 states and 38051 transitions. [2019-12-18 15:02:59,385 INFO L78 Accepts]: Start accepts. Automaton has 13282 states and 38051 transitions. Word has length 33 [2019-12-18 15:02:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:59,385 INFO L462 AbstractCegarLoop]: Abstraction has 13282 states and 38051 transitions. [2019-12-18 15:02:59,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:02:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13282 states and 38051 transitions. [2019-12-18 15:02:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:02:59,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:59,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:02:59,397 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1835008453, now seen corresponding path program 1 times [2019-12-18 15:02:59,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:59,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81702849] [2019-12-18 15:02:59,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:02:59,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81702849] [2019-12-18 15:02:59,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:59,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:02:59,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544336676] [2019-12-18 15:02:59,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:02:59,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:59,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:02:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:59,477 INFO L87 Difference]: Start difference. First operand 13282 states and 38051 transitions. Second operand 3 states. [2019-12-18 15:02:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:59,535 INFO L93 Difference]: Finished difference Result 13220 states and 37851 transitions. [2019-12-18 15:02:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:02:59,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 15:02:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:59,557 INFO L225 Difference]: With dead ends: 13220 [2019-12-18 15:02:59,557 INFO L226 Difference]: Without dead ends: 13220 [2019-12-18 15:02:59,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:02:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13220 states. [2019-12-18 15:02:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13220 to 11800. [2019-12-18 15:02:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11800 states. [2019-12-18 15:02:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11800 states to 11800 states and 34134 transitions. [2019-12-18 15:02:59,796 INFO L78 Accepts]: Start accepts. Automaton has 11800 states and 34134 transitions. Word has length 41 [2019-12-18 15:02:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:02:59,796 INFO L462 AbstractCegarLoop]: Abstraction has 11800 states and 34134 transitions. [2019-12-18 15:02:59,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:02:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 11800 states and 34134 transitions. [2019-12-18 15:02:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 15:02:59,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:02:59,812 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] [2019-12-18 15:02:59,812 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:02:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:02:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-18 15:02:59,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:02:59,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056660829] [2019-12-18 15:02:59,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:02:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:02:59,890 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-18 15:02:59,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056660829] [2019-12-18 15:02:59,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:02:59,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:02:59,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127311170] [2019-12-18 15:02:59,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:02:59,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:02:59,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:02:59,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:02:59,893 INFO L87 Difference]: Start difference. First operand 11800 states and 34134 transitions. Second operand 6 states. [2019-12-18 15:02:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:02:59,978 INFO L93 Difference]: Finished difference Result 10968 states and 32315 transitions. [2019-12-18 15:02:59,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:02:59,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 15:02:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:02:59,993 INFO L225 Difference]: With dead ends: 10968 [2019-12-18 15:02:59,993 INFO L226 Difference]: Without dead ends: 8764 [2019-12-18 15:02:59,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:03:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2019-12-18 15:03:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 8764. [2019-12-18 15:03:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8764 states. [2019-12-18 15:03:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8764 states to 8764 states and 27303 transitions. [2019-12-18 15:03:00,122 INFO L78 Accepts]: Start accepts. Automaton has 8764 states and 27303 transitions. Word has length 42 [2019-12-18 15:03:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:00,122 INFO L462 AbstractCegarLoop]: Abstraction has 8764 states and 27303 transitions. [2019-12-18 15:03:00,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:03:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8764 states and 27303 transitions. [2019-12-18 15:03:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:00,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:00,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:00,133 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-18 15:03:00,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:00,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723229939] [2019-12-18 15:03:00,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:00,177 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-18 15:03:00,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723229939] [2019-12-18 15:03:00,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:00,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:03:00,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786375321] [2019-12-18 15:03:00,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:03:00,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:00,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:03:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:00,180 INFO L87 Difference]: Start difference. First operand 8764 states and 27303 transitions. Second operand 3 states. [2019-12-18 15:03:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:00,266 INFO L93 Difference]: Finished difference Result 12928 states and 40421 transitions. [2019-12-18 15:03:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:03:00,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 15:03:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:00,296 INFO L225 Difference]: With dead ends: 12928 [2019-12-18 15:03:00,296 INFO L226 Difference]: Without dead ends: 12928 [2019-12-18 15:03:00,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:00,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12928 states. [2019-12-18 15:03:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12928 to 10612. [2019-12-18 15:03:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10612 states. [2019-12-18 15:03:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10612 states to 10612 states and 33449 transitions. [2019-12-18 15:03:00,553 INFO L78 Accepts]: Start accepts. Automaton has 10612 states and 33449 transitions. Word has length 66 [2019-12-18 15:03:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:00,553 INFO L462 AbstractCegarLoop]: Abstraction has 10612 states and 33449 transitions. [2019-12-18 15:03:00,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:03:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 10612 states and 33449 transitions. [2019-12-18 15:03:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:00,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:00,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:00,566 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-18 15:03:00,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:00,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991720999] [2019-12-18 15:03:00,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:00,604 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-18 15:03:00,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991720999] [2019-12-18 15:03:00,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:00,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:03:00,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355681284] [2019-12-18 15:03:00,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:03:00,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:03:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:00,606 INFO L87 Difference]: Start difference. First operand 10612 states and 33449 transitions. Second operand 3 states. [2019-12-18 15:03:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:00,696 INFO L93 Difference]: Finished difference Result 12928 states and 39101 transitions. [2019-12-18 15:03:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:03:00,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 15:03:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:00,717 INFO L225 Difference]: With dead ends: 12928 [2019-12-18 15:03:00,718 INFO L226 Difference]: Without dead ends: 12928 [2019-12-18 15:03:00,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:03:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12928 states. [2019-12-18 15:03:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12928 to 10324. [2019-12-18 15:03:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10324 states. [2019-12-18 15:03:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10324 states to 10324 states and 31337 transitions. [2019-12-18 15:03:01,052 INFO L78 Accepts]: Start accepts. Automaton has 10324 states and 31337 transitions. Word has length 66 [2019-12-18 15:03:01,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:01,052 INFO L462 AbstractCegarLoop]: Abstraction has 10324 states and 31337 transitions. [2019-12-18 15:03:01,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:03:01,052 INFO L276 IsEmpty]: Start isEmpty. Operand 10324 states and 31337 transitions. [2019-12-18 15:03:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:01,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:01,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:01,067 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:01,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:01,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-18 15:03:01,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:01,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244793100] [2019-12-18 15:03:01,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:01,159 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-18 15:03:01,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244793100] [2019-12-18 15:03:01,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:01,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:03:01,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369500167] [2019-12-18 15:03:01,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:03:01,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:01,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:03:01,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:03:01,161 INFO L87 Difference]: Start difference. First operand 10324 states and 31337 transitions. Second operand 7 states. [2019-12-18 15:03:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:01,438 INFO L93 Difference]: Finished difference Result 19829 states and 59127 transitions. [2019-12-18 15:03:01,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:03:01,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 15:03:01,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:01,459 INFO L225 Difference]: With dead ends: 19829 [2019-12-18 15:03:01,459 INFO L226 Difference]: Without dead ends: 14051 [2019-12-18 15:03:01,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:03:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-18 15:03:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 11967. [2019-12-18 15:03:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11967 states. [2019-12-18 15:03:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11967 states to 11967 states and 35782 transitions. [2019-12-18 15:03:01,662 INFO L78 Accepts]: Start accepts. Automaton has 11967 states and 35782 transitions. Word has length 66 [2019-12-18 15:03:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:01,662 INFO L462 AbstractCegarLoop]: Abstraction has 11967 states and 35782 transitions. [2019-12-18 15:03:01,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:03:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 11967 states and 35782 transitions. [2019-12-18 15:03:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:01,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:01,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:01,675 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:01,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-18 15:03:01,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:01,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767052525] [2019-12-18 15:03:01,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:01,789 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-18 15:03:01,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767052525] [2019-12-18 15:03:01,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:01,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:03:01,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8112570] [2019-12-18 15:03:01,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:03:01,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:03:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:03:01,791 INFO L87 Difference]: Start difference. First operand 11967 states and 35782 transitions. Second operand 8 states. [2019-12-18 15:03:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:02,920 INFO L93 Difference]: Finished difference Result 19135 states and 55748 transitions. [2019-12-18 15:03:02,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:03:02,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 15:03:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:02,947 INFO L225 Difference]: With dead ends: 19135 [2019-12-18 15:03:02,947 INFO L226 Difference]: Without dead ends: 18919 [2019-12-18 15:03:02,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:03:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18919 states. [2019-12-18 15:03:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18919 to 12873. [2019-12-18 15:03:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12873 states. [2019-12-18 15:03:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12873 states to 12873 states and 38351 transitions. [2019-12-18 15:03:03,193 INFO L78 Accepts]: Start accepts. Automaton has 12873 states and 38351 transitions. Word has length 66 [2019-12-18 15:03:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:03,193 INFO L462 AbstractCegarLoop]: Abstraction has 12873 states and 38351 transitions. [2019-12-18 15:03:03,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:03:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12873 states and 38351 transitions. [2019-12-18 15:03:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:03,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:03,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:03,208 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1259142147, now seen corresponding path program 3 times [2019-12-18 15:03:03,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:03,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412503834] [2019-12-18 15:03:03,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:03,600 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-18 15:03:03,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412503834] [2019-12-18 15:03:03,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:03,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:03:03,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174706904] [2019-12-18 15:03:03,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:03:03,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:03:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:03:03,612 INFO L87 Difference]: Start difference. First operand 12873 states and 38351 transitions. Second operand 14 states. [2019-12-18 15:03:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:06,882 INFO L93 Difference]: Finished difference Result 20194 states and 59716 transitions. [2019-12-18 15:03:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 15:03:06,882 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 66 [2019-12-18 15:03:06,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:06,907 INFO L225 Difference]: With dead ends: 20194 [2019-12-18 15:03:06,908 INFO L226 Difference]: Without dead ends: 16947 [2019-12-18 15:03:06,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=241, Invalid=1241, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:03:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16947 states. [2019-12-18 15:03:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16947 to 15752. [2019-12-18 15:03:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-12-18 15:03:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 46454 transitions. [2019-12-18 15:03:07,163 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 46454 transitions. Word has length 66 [2019-12-18 15:03:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:07,164 INFO L462 AbstractCegarLoop]: Abstraction has 15752 states and 46454 transitions. [2019-12-18 15:03:07,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:03:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 46454 transitions. [2019-12-18 15:03:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:07,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:07,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:07,182 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash 963274045, now seen corresponding path program 4 times [2019-12-18 15:03:07,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:07,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068776515] [2019-12-18 15:03:07,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:07,570 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-18 15:03:07,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068776515] [2019-12-18 15:03:07,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:07,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:03:07,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290701589] [2019-12-18 15:03:07,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:03:07,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:07,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:03:07,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:03:07,572 INFO L87 Difference]: Start difference. First operand 15752 states and 46454 transitions. Second operand 15 states. [2019-12-18 15:03:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:10,328 INFO L93 Difference]: Finished difference Result 25214 states and 73418 transitions. [2019-12-18 15:03:10,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 15:03:10,329 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 15:03:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:10,350 INFO L225 Difference]: With dead ends: 25214 [2019-12-18 15:03:10,350 INFO L226 Difference]: Without dead ends: 15501 [2019-12-18 15:03:10,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=1339, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:03:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15501 states. [2019-12-18 15:03:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15501 to 13721. [2019-12-18 15:03:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13721 states. [2019-12-18 15:03:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13721 states to 13721 states and 40414 transitions. [2019-12-18 15:03:10,562 INFO L78 Accepts]: Start accepts. Automaton has 13721 states and 40414 transitions. Word has length 66 [2019-12-18 15:03:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:10,563 INFO L462 AbstractCegarLoop]: Abstraction has 13721 states and 40414 transitions. [2019-12-18 15:03:10,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:03:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 13721 states and 40414 transitions. [2019-12-18 15:03:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:10,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:10,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:10,577 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash 98399265, now seen corresponding path program 5 times [2019-12-18 15:03:10,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:10,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318033066] [2019-12-18 15:03:10,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:11,120 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-18 15:03:11,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318033066] [2019-12-18 15:03:11,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:11,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:03:11,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127438318] [2019-12-18 15:03:11,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:03:11,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:11,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:03:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:03:11,122 INFO L87 Difference]: Start difference. First operand 13721 states and 40414 transitions. Second operand 17 states. [2019-12-18 15:03:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:13,490 INFO L93 Difference]: Finished difference Result 17496 states and 50702 transitions. [2019-12-18 15:03:13,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:03:13,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 15:03:13,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:13,514 INFO L225 Difference]: With dead ends: 17496 [2019-12-18 15:03:13,515 INFO L226 Difference]: Without dead ends: 16029 [2019-12-18 15:03:13,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:03:13,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16029 states. [2019-12-18 15:03:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16029 to 13901. [2019-12-18 15:03:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13901 states. [2019-12-18 15:03:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13901 states to 13901 states and 40869 transitions. [2019-12-18 15:03:13,739 INFO L78 Accepts]: Start accepts. Automaton has 13901 states and 40869 transitions. Word has length 66 [2019-12-18 15:03:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:13,740 INFO L462 AbstractCegarLoop]: Abstraction has 13901 states and 40869 transitions. [2019-12-18 15:03:13,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:03:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 13901 states and 40869 transitions. [2019-12-18 15:03:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:13,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:13,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:13,755 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1825007225, now seen corresponding path program 6 times [2019-12-18 15:03:13,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:13,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73289964] [2019-12-18 15:03:13,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:14,188 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-18 15:03:14,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73289964] [2019-12-18 15:03:14,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:14,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:03:14,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000518749] [2019-12-18 15:03:14,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:03:14,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:14,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:03:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:03:14,190 INFO L87 Difference]: Start difference. First operand 13901 states and 40869 transitions. Second operand 16 states. [2019-12-18 15:03:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:16,487 INFO L93 Difference]: Finished difference Result 16519 states and 47845 transitions. [2019-12-18 15:03:16,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:03:16,488 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 15:03:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:16,513 INFO L225 Difference]: With dead ends: 16519 [2019-12-18 15:03:16,513 INFO L226 Difference]: Without dead ends: 16064 [2019-12-18 15:03:16,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:03:16,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16064 states. [2019-12-18 15:03:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16064 to 13893. [2019-12-18 15:03:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13893 states. [2019-12-18 15:03:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13893 states to 13893 states and 40849 transitions. [2019-12-18 15:03:16,744 INFO L78 Accepts]: Start accepts. Automaton has 13893 states and 40849 transitions. Word has length 66 [2019-12-18 15:03:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:16,744 INFO L462 AbstractCegarLoop]: Abstraction has 13893 states and 40849 transitions. [2019-12-18 15:03:16,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:03:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 13893 states and 40849 transitions. [2019-12-18 15:03:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:16,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:16,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:16,760 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:16,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -579313991, now seen corresponding path program 7 times [2019-12-18 15:03:16,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:16,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145540796] [2019-12-18 15:03:16,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:16,874 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-18 15:03:16,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145540796] [2019-12-18 15:03:16,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:16,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:03:16,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694258617] [2019-12-18 15:03:16,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:03:16,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:16,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:03:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:03:16,877 INFO L87 Difference]: Start difference. First operand 13893 states and 40849 transitions. Second operand 9 states. [2019-12-18 15:03:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:17,997 INFO L93 Difference]: Finished difference Result 21166 states and 61264 transitions. [2019-12-18 15:03:17,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:03:17,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 15:03:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:18,019 INFO L225 Difference]: With dead ends: 21166 [2019-12-18 15:03:18,019 INFO L226 Difference]: Without dead ends: 16944 [2019-12-18 15:03:18,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:03:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16944 states. [2019-12-18 15:03:18,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16944 to 14025. [2019-12-18 15:03:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14025 states. [2019-12-18 15:03:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14025 states to 14025 states and 40955 transitions. [2019-12-18 15:03:18,231 INFO L78 Accepts]: Start accepts. Automaton has 14025 states and 40955 transitions. Word has length 66 [2019-12-18 15:03:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:18,231 INFO L462 AbstractCegarLoop]: Abstraction has 14025 states and 40955 transitions. [2019-12-18 15:03:18,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:03:18,231 INFO L276 IsEmpty]: Start isEmpty. Operand 14025 states and 40955 transitions. [2019-12-18 15:03:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:18,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:18,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:18,246 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:18,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1571120921, now seen corresponding path program 8 times [2019-12-18 15:03:18,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:18,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885983983] [2019-12-18 15:03:18,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:18,350 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-18 15:03:18,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885983983] [2019-12-18 15:03:18,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:18,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:03:18,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638609455] [2019-12-18 15:03:18,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:03:18,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:18,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:03:18,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:03:18,351 INFO L87 Difference]: Start difference. First operand 14025 states and 40955 transitions. Second operand 9 states. [2019-12-18 15:03:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:19,290 INFO L93 Difference]: Finished difference Result 20531 states and 59308 transitions. [2019-12-18 15:03:19,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:03:19,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 15:03:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:19,313 INFO L225 Difference]: With dead ends: 20531 [2019-12-18 15:03:19,313 INFO L226 Difference]: Without dead ends: 16416 [2019-12-18 15:03:19,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:03:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16416 states. [2019-12-18 15:03:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16416 to 13881. [2019-12-18 15:03:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13881 states. [2019-12-18 15:03:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13881 states to 13881 states and 40531 transitions. [2019-12-18 15:03:19,526 INFO L78 Accepts]: Start accepts. Automaton has 13881 states and 40531 transitions. Word has length 66 [2019-12-18 15:03:19,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:19,527 INFO L462 AbstractCegarLoop]: Abstraction has 13881 states and 40531 transitions. [2019-12-18 15:03:19,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:03:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 13881 states and 40531 transitions. [2019-12-18 15:03:19,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:19,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:19,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:19,541 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:19,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1373769533, now seen corresponding path program 9 times [2019-12-18 15:03:19,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:19,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176877576] [2019-12-18 15:03:19,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:19,698 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-18 15:03:19,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176877576] [2019-12-18 15:03:19,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:19,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 15:03:19,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163664258] [2019-12-18 15:03:19,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:03:19,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:19,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:03:19,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:03:19,700 INFO L87 Difference]: Start difference. First operand 13881 states and 40531 transitions. Second operand 10 states. [2019-12-18 15:03:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:21,381 INFO L93 Difference]: Finished difference Result 26682 states and 76647 transitions. [2019-12-18 15:03:21,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 15:03:21,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 15:03:21,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:21,417 INFO L225 Difference]: With dead ends: 26682 [2019-12-18 15:03:21,417 INFO L226 Difference]: Without dead ends: 26682 [2019-12-18 15:03:21,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:03:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26682 states. [2019-12-18 15:03:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26682 to 13310. [2019-12-18 15:03:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13310 states. [2019-12-18 15:03:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13310 states to 13310 states and 38531 transitions. [2019-12-18 15:03:21,694 INFO L78 Accepts]: Start accepts. Automaton has 13310 states and 38531 transitions. Word has length 66 [2019-12-18 15:03:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:21,694 INFO L462 AbstractCegarLoop]: Abstraction has 13310 states and 38531 transitions. [2019-12-18 15:03:21,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:03:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13310 states and 38531 transitions. [2019-12-18 15:03:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:21,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:21,707 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:21,708 INFO L82 PathProgramCache]: Analyzing trace with hash -766459999, now seen corresponding path program 10 times [2019-12-18 15:03:21,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:21,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973897052] [2019-12-18 15:03:21,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:22,044 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-18 15:03:22,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973897052] [2019-12-18 15:03:22,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:22,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:03:22,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237675790] [2019-12-18 15:03:22,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:03:22,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:03:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:03:22,046 INFO L87 Difference]: Start difference. First operand 13310 states and 38531 transitions. Second operand 13 states. [2019-12-18 15:03:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:24,166 INFO L93 Difference]: Finished difference Result 15897 states and 45423 transitions. [2019-12-18 15:03:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:03:24,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 15:03:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:24,189 INFO L225 Difference]: With dead ends: 15897 [2019-12-18 15:03:24,189 INFO L226 Difference]: Without dead ends: 14806 [2019-12-18 15:03:24,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:03:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14806 states. [2019-12-18 15:03:24,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14806 to 13786. [2019-12-18 15:03:24,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13786 states. [2019-12-18 15:03:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13786 states to 13786 states and 39779 transitions. [2019-12-18 15:03:24,402 INFO L78 Accepts]: Start accepts. Automaton has 13786 states and 39779 transitions. Word has length 66 [2019-12-18 15:03:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:24,402 INFO L462 AbstractCegarLoop]: Abstraction has 13786 states and 39779 transitions. [2019-12-18 15:03:24,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:03:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 13786 states and 39779 transitions. [2019-12-18 15:03:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:24,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:24,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:24,417 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:24,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1455956193, now seen corresponding path program 11 times [2019-12-18 15:03:24,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:24,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521091876] [2019-12-18 15:03:24,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:03:24,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521091876] [2019-12-18 15:03:24,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:24,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:03:24,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692572854] [2019-12-18 15:03:24,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:03:24,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:03:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:03:24,741 INFO L87 Difference]: Start difference. First operand 13786 states and 39779 transitions. Second operand 13 states. [2019-12-18 15:03:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:26,759 INFO L93 Difference]: Finished difference Result 17088 states and 48506 transitions. [2019-12-18 15:03:26,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 15:03:26,760 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 15:03:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:26,780 INFO L225 Difference]: With dead ends: 17088 [2019-12-18 15:03:26,780 INFO L226 Difference]: Without dead ends: 15423 [2019-12-18 15:03:26,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:03:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15423 states. [2019-12-18 15:03:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15423 to 13356. [2019-12-18 15:03:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13356 states. [2019-12-18 15:03:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13356 states to 13356 states and 38639 transitions. [2019-12-18 15:03:26,982 INFO L78 Accepts]: Start accepts. Automaton has 13356 states and 38639 transitions. Word has length 66 [2019-12-18 15:03:26,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:26,982 INFO L462 AbstractCegarLoop]: Abstraction has 13356 states and 38639 transitions. [2019-12-18 15:03:26,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:03:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13356 states and 38639 transitions. [2019-12-18 15:03:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:03:26,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:26,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:26,999 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:26,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash 640702257, now seen corresponding path program 12 times [2019-12-18 15:03:26,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:26,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544337132] [2019-12-18 15:03:26,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:27,076 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-18 15:03:27,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544337132] [2019-12-18 15:03:27,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:27,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:03:27,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504715113] [2019-12-18 15:03:27,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:03:27,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:27,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:03:27,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:03:27,078 INFO L87 Difference]: Start difference. First operand 13356 states and 38639 transitions. Second operand 4 states. [2019-12-18 15:03:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:27,203 INFO L93 Difference]: Finished difference Result 15158 states and 44056 transitions. [2019-12-18 15:03:27,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:03:27,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 15:03:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:27,231 INFO L225 Difference]: With dead ends: 15158 [2019-12-18 15:03:27,231 INFO L226 Difference]: Without dead ends: 15158 [2019-12-18 15:03:27,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:03:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15158 states. [2019-12-18 15:03:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15158 to 12299. [2019-12-18 15:03:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12299 states. [2019-12-18 15:03:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12299 states to 12299 states and 35952 transitions. [2019-12-18 15:03:27,444 INFO L78 Accepts]: Start accepts. Automaton has 12299 states and 35952 transitions. Word has length 66 [2019-12-18 15:03:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:27,444 INFO L462 AbstractCegarLoop]: Abstraction has 12299 states and 35952 transitions. [2019-12-18 15:03:27,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:03:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 35952 transitions. [2019-12-18 15:03:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:27,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:27,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:27,457 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:27,458 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 1 times [2019-12-18 15:03:27,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:27,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128005129] [2019-12-18 15:03:27,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:28,156 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-18 15:03:28,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128005129] [2019-12-18 15:03:28,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:28,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:03:28,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124329271] [2019-12-18 15:03:28,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:03:28,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:28,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:03:28,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:03:28,158 INFO L87 Difference]: Start difference. First operand 12299 states and 35952 transitions. Second operand 17 states. [2019-12-18 15:03:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:33,592 INFO L93 Difference]: Finished difference Result 19029 states and 54417 transitions. [2019-12-18 15:03:33,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-18 15:03:33,592 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 15:03:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:33,617 INFO L225 Difference]: With dead ends: 19029 [2019-12-18 15:03:33,617 INFO L226 Difference]: Without dead ends: 17634 [2019-12-18 15:03:33,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=552, Invalid=4418, Unknown=0, NotChecked=0, Total=4970 [2019-12-18 15:03:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17634 states. [2019-12-18 15:03:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17634 to 13635. [2019-12-18 15:03:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2019-12-18 15:03:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 39577 transitions. [2019-12-18 15:03:33,835 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 39577 transitions. Word has length 67 [2019-12-18 15:03:33,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:33,835 INFO L462 AbstractCegarLoop]: Abstraction has 13635 states and 39577 transitions. [2019-12-18 15:03:33,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:03:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 39577 transitions. [2019-12-18 15:03:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:33,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:33,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:33,849 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:33,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:33,849 INFO L82 PathProgramCache]: Analyzing trace with hash 519688642, now seen corresponding path program 2 times [2019-12-18 15:03:33,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:33,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56342117] [2019-12-18 15:03:33,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:34,422 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-18 15:03:34,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56342117] [2019-12-18 15:03:34,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:34,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:03:34,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434238679] [2019-12-18 15:03:34,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:03:34,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:03:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:03:34,424 INFO L87 Difference]: Start difference. First operand 13635 states and 39577 transitions. Second operand 17 states. [2019-12-18 15:03:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:03:39,844 INFO L93 Difference]: Finished difference Result 20463 states and 58138 transitions. [2019-12-18 15:03:39,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-18 15:03:39,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 15:03:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:03:39,870 INFO L225 Difference]: With dead ends: 20463 [2019-12-18 15:03:39,871 INFO L226 Difference]: Without dead ends: 17041 [2019-12-18 15:03:39,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=608, Invalid=4222, Unknown=0, NotChecked=0, Total=4830 [2019-12-18 15:03:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17041 states. [2019-12-18 15:03:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17041 to 12627. [2019-12-18 15:03:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12627 states. [2019-12-18 15:03:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12627 states to 12627 states and 36657 transitions. [2019-12-18 15:03:40,100 INFO L78 Accepts]: Start accepts. Automaton has 12627 states and 36657 transitions. Word has length 67 [2019-12-18 15:03:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:03:40,100 INFO L462 AbstractCegarLoop]: Abstraction has 12627 states and 36657 transitions. [2019-12-18 15:03:40,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:03:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 12627 states and 36657 transitions. [2019-12-18 15:03:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:03:40,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:03:40,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:03:40,115 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:03:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:03:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1102267118, now seen corresponding path program 3 times [2019-12-18 15:03:40,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:03:40,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156636672] [2019-12-18 15:03:40,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:03:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:03:40,702 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-18 15:03:40,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156636672] [2019-12-18 15:03:40,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:03:40,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:03:40,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581851545] [2019-12-18 15:03:40,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:03:40,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:03:40,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:03:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:03:40,704 INFO L87 Difference]: Start difference. First operand 12627 states and 36657 transitions. Second operand 18 states. Received shutdown request... [2019-12-18 15:03:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-18 15:03:43,586 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:03:43,589 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:03:43,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:03:43 BasicIcfg [2019-12-18 15:03:43,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:03:43,591 INFO L168 Benchmark]: Toolchain (without parser) took 198185.35 ms. Allocated memory was 138.9 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 101.7 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 15:03:43,591 INFO L168 Benchmark]: CDTParser took 0.22 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.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 15:03:43,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.92 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 155.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:43,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.45 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:43,592 INFO L168 Benchmark]: Boogie Preprocessor took 39.67 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:43,593 INFO L168 Benchmark]: RCFGBuilder took 808.81 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 100.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:03:43,593 INFO L168 Benchmark]: TraceAbstraction took 196424.30 ms. Allocated memory was 203.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 99.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 15:03:43,595 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.22 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.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.92 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 155.5 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.45 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.67 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 150.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 808.81 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 100.6 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 196424.30 ms. Allocated memory was 203.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 99.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (12627states) and FLOYD_HOARE automaton (currently 43 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (12627states) and FLOYD_HOARE automaton (currently 43 states, 18 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 47 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: TIMEOUT, OverallTime: 196.1s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 79.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6622 SDtfs, 9653 SDslu, 25252 SDs, 0 SdLazy, 28861 SolverSat, 598 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 48 SyntacticMatches, 32 SemanticMatches, 538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5074 ImplicationChecksByTransitivity, 11.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206903occurred 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: 87.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 194686 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1534 NumberOfCodeBlocks, 1534 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1500 ConstructedInterpolants, 0 QuantifiedInterpolants, 536501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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