/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:10:47,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:10:47,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:10:47,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:10:47,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:10:47,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:10:47,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:10:47,261 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:10:47,263 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:10:47,264 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:10:47,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:10:47,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:10:47,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:10:47,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:10:47,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:10:47,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:10:47,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:10:47,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:10:47,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:10:47,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:10:47,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:10:47,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:10:47,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:10:47,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:10:47,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:10:47,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:10:47,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:10:47,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:10:47,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:10:47,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:10:47,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:10:47,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:10:47,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:10:47,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:10:47,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:10:47,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:10:47,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:10:47,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:10:47,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:10:47,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:10:47,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:10:47,292 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:10:47,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:10:47,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:10:47,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:10:47,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:10:47,307 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:10:47,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:10:47,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:10:47,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:10:47,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:10:47,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:10:47,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:10:47,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:10:47,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:10:47,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:10:47,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:10:47,310 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:10:47,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:10:47,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:10:47,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:10:47,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:10:47,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:10:47,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:10:47,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:10:47,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:10:47,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:10:47,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:10:47,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:10:47,312 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:10:47,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:10:47,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:10:47,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:10:47,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:10:47,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:10:47,612 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:10:47,613 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:10:47,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-18 23:10:47,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d2e0165/7762b2e9570b4c3d9a92b5152fbbf047/FLAG3def28248 [2019-12-18 23:10:48,197 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:10:48,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-18 23:10:48,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d2e0165/7762b2e9570b4c3d9a92b5152fbbf047/FLAG3def28248 [2019-12-18 23:10:48,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d2e0165/7762b2e9570b4c3d9a92b5152fbbf047 [2019-12-18 23:10:48,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:10:48,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:10:48,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:10:48,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:10:48,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:10:48,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:10:48" (1/1) ... [2019-12-18 23:10:48,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77438b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:48, skipping insertion in model container [2019-12-18 23:10:48,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:10:48" (1/1) ... [2019-12-18 23:10:48,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:10:48,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:10:49,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:10:49,178 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:10:49,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:10:49,305 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:10:49,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49 WrapperNode [2019-12-18 23:10:49,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:10:49,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:10:49,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:10:49,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:10:49,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:10:49,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:10:49,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:10:49,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:10:49,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (1/1) ... [2019-12-18 23:10:49,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:10:49,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:10:49,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:10:49,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:10:49,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (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 23:10:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 23:10:49,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 23:10:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 23:10:49,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 23:10:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:10:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:10:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:10:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:10:49,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:10:49,475 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 23:10:49,803 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:10:49,803 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 23:10:49,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:10:49 BoogieIcfgContainer [2019-12-18 23:10:49,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:10:49,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:10:49,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:10:49,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:10:49,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:10:48" (1/3) ... [2019-12-18 23:10:49,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb4e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:10:49, skipping insertion in model container [2019-12-18 23:10:49,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:10:49" (2/3) ... [2019-12-18 23:10:49,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edb4e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:10:49, skipping insertion in model container [2019-12-18 23:10:49,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:10:49" (3/3) ... [2019-12-18 23:10:49,813 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2019-12-18 23:10:49,822 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:10:49,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:10:49,829 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 23:10:49,830 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:10:49,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,865 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,866 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,867 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,872 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,872 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,878 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,879 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,879 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,879 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,880 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:49,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 23:10:49,917 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:49,917 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:49,917 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:49,918 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:49,918 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:49,918 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:49,918 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:49,918 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:49,931 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-18 23:10:49,933 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 23:10:49,994 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 23:10:49,994 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:50,000 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 8/63 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 23:10:50,004 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 23:10:50,021 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 23:10:50,022 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:50,023 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 8/63 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 23:10:50,025 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-18 23:10:50,027 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:51,248 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:10:51,389 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-18 23:10:51,390 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-18 23:10:51,394 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 23:10:51,406 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 23:10:51,410 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 23:10:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:51,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:51,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:51,424 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-18 23:10:51,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:51,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058949882] [2019-12-18 23:10:51,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:51,748 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 23:10:51,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058949882] [2019-12-18 23:10:51,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:51,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:51,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213111391] [2019-12-18 23:10:51,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:51,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:51,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:51,779 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 23:10:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:51,814 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 23:10:51,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:51,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:51,834 INFO L225 Difference]: With dead ends: 35 [2019-12-18 23:10:51,835 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 23:10:51,842 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 23:10:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 23:10:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 23:10:51,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 23:10:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 23:10:51,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 23:10:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:51,896 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 23:10:51,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 23:10:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 23:10:51,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:51,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:51,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-18 23:10:51,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:51,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110021215] [2019-12-18 23:10:51,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:52,029 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 23:10:52,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110021215] [2019-12-18 23:10:52,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:52,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:10:52,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697190743] [2019-12-18 23:10:52,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:10:52,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:10:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:10:52,033 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 23:10:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:52,057 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 23:10:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:10:52,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 23:10:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:52,060 INFO L225 Difference]: With dead ends: 26 [2019-12-18 23:10:52,060 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 23:10:52,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 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 23:10:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 23:10:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 23:10:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 23:10:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 23:10:52,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 23:10:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:52,067 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 23:10:52,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:10:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 23:10:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 23:10:52,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:52,068 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:52,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-18 23:10:52,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:52,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839171932] [2019-12-18 23:10:52,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:52,157 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:10:52,157 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:10:52,158 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:10:52,158 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 23:10:52,167 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,167 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,167 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,167 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,168 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,168 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,168 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,168 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,168 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,169 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,169 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,169 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,174 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,175 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,175 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,175 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,178 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,178 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,178 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,178 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,178 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,181 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,181 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,181 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,181 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,182 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,182 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:52,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:10:52,186 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:52,186 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:52,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:52,187 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:52,187 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:52,187 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:52,187 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:52,187 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:52,190 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-18 23:10:52,190 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 23:10:52,207 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 23:10:52,207 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:52,210 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 20/95 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-18 23:10:52,214 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 23:10:52,230 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 23:10:52,230 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:52,232 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 20/95 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-18 23:10:52,237 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-18 23:10:52,237 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:53,299 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 23:10:53,585 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-18 23:10:53,585 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-18 23:10:53,586 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 23:10:53,599 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 23:10:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 23:10:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:53,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:53,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:53,600 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-18 23:10:53,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:53,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274965758] [2019-12-18 23:10:53,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:53,633 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 23:10:53,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274965758] [2019-12-18 23:10:53,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:53,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:53,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970344578] [2019-12-18 23:10:53,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:53,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:53,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:53,635 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 23:10:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:53,665 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 23:10:53,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:53,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:53,670 INFO L225 Difference]: With dead ends: 185 [2019-12-18 23:10:53,670 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 23:10:53,671 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 23:10:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 23:10:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 23:10:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 23:10:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 23:10:53,708 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 23:10:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:53,709 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 23:10:53,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 23:10:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:10:53,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:53,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:53,710 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:53,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-18 23:10:53,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:53,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723176528] [2019-12-18 23:10:53,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:53,751 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 23:10:53,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723176528] [2019-12-18 23:10:53,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:53,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:53,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108520215] [2019-12-18 23:10:53,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:53,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:53,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:53,754 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 23:10:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:53,815 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-18 23:10:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:53,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:10:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:53,818 INFO L225 Difference]: With dead ends: 204 [2019-12-18 23:10:53,819 INFO L226 Difference]: Without dead ends: 201 [2019-12-18 23:10:53,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-18 23:10:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-18 23:10:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 23:10:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 23:10:53,852 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 23:10:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:53,852 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 23:10:53,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 23:10:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:10:53,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:53,858 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:53,858 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-18 23:10:53,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:53,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228939175] [2019-12-18 23:10:53,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:10:53,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228939175] [2019-12-18 23:10:53,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:53,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:53,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807437509] [2019-12-18 23:10:53,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:53,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:53,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:53,943 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 23:10:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:54,010 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-18 23:10:54,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:54,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:10:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:54,013 INFO L225 Difference]: With dead ends: 189 [2019-12-18 23:10:54,013 INFO L226 Difference]: Without dead ends: 185 [2019-12-18 23:10:54,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-18 23:10:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-18 23:10:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 23:10:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 23:10:54,026 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 23:10:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:54,027 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 23:10:54,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:54,028 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 23:10:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:10:54,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:54,029 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:54,029 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:54,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-18 23:10:54,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:54,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564993431] [2019-12-18 23:10:54,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:54,063 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:10:54,064 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:10:54,064 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:10:54,064 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 23:10:54,074 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,074 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,075 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,076 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,076 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,076 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,076 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,076 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,077 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,077 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,077 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,077 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,077 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,077 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,078 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,078 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,078 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,078 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,078 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,079 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,089 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,090 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,090 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,091 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,091 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,091 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,092 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,092 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,092 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,092 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,093 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,093 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,093 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,093 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,094 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,094 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,094 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,094 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,094 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,095 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,095 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,095 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,095 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,095 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,096 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,096 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,096 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,096 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,096 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,096 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,097 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,097 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,097 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,098 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,098 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,098 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,098 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,101 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,101 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,102 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,102 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,102 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,103 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,103 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,103 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,104 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,104 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,106 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,106 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,107 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,107 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,107 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,109 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,109 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,109 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,109 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,109 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,110 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,111 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,111 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,111 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,111 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,111 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,111 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:54,112 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:10:54,113 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:54,113 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:54,113 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:54,113 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:54,113 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:54,113 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:54,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:54,113 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:54,116 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-18 23:10:54,116 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 23:10:54,134 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 23:10:54,134 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:54,136 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 23:10:54,140 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 23:10:54,157 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 23:10:54,158 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:54,159 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 23:10:54,163 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-18 23:10:54,163 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:55,636 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:10:55,700 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-18 23:10:55,700 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-18 23:10:55,700 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 23:10:55,726 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 23:10:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 23:10:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:55,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:55,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:55,728 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-18 23:10:55,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:55,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110964971] [2019-12-18 23:10:55,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:10:55,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110964971] [2019-12-18 23:10:55,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:55,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:55,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850906716] [2019-12-18 23:10:55,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:55,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:55,758 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 23:10:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:55,790 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 23:10:55,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:55,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:55,797 INFO L225 Difference]: With dead ends: 600 [2019-12-18 23:10:55,797 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 23:10:55,797 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 23:10:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 23:10:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 23:10:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 23:10:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 23:10:55,838 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 23:10:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:55,839 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 23:10:55,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 23:10:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:10:55,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:55,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:55,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:55,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-18 23:10:55,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:55,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148162973] [2019-12-18 23:10:55,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:55,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 23:10:55,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148162973] [2019-12-18 23:10:55,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:55,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:55,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024481584] [2019-12-18 23:10:55,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:55,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:55,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:55,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:55,899 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 23:10:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:55,977 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-18 23:10:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:55,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:10:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:55,983 INFO L225 Difference]: With dead ends: 802 [2019-12-18 23:10:55,984 INFO L226 Difference]: Without dead ends: 799 [2019-12-18 23:10:55,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-18 23:10:56,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-18 23:10:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 23:10:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 23:10:56,010 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 23:10:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,011 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 23:10:56,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 23:10:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:10:56,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,012 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,013 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,013 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-18 23:10:56,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870907464] [2019-12-18 23:10:56,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:10:56,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870907464] [2019-12-18 23:10:56,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:56,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:56,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014178324] [2019-12-18 23:10:56,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:56,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:56,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:56,072 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 23:10:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:56,154 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-18 23:10:56,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:56,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:10:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:56,160 INFO L225 Difference]: With dead ends: 832 [2019-12-18 23:10:56,161 INFO L226 Difference]: Without dead ends: 828 [2019-12-18 23:10:56,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-18 23:10:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-18 23:10:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 23:10:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 23:10:56,184 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 23:10:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,185 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 23:10:56,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 23:10:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:10:56,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,186 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,187 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:56,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-18 23:10:56,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679947839] [2019-12-18 23:10:56,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:10:56,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679947839] [2019-12-18 23:10:56,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376303690] [2019-12-18 23:10:56,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:10:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:10:56,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:10:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:10:56,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:10:56,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 23:10:56,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246725741] [2019-12-18 23:10:56,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:10:56,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:10:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:10:56,373 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-18 23:10:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:56,601 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-18 23:10:56,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:10:56,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 23:10:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:56,609 INFO L225 Difference]: With dead ends: 1052 [2019-12-18 23:10:56,609 INFO L226 Difference]: Without dead ends: 1048 [2019-12-18 23:10:56,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 23:10:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-18 23:10:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-18 23:10:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-18 23:10:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-18 23:10:56,635 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-18 23:10:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:56,635 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-18 23:10:56,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:10:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-18 23:10:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:10:56,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:56,636 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:56,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:10:56,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:56,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-18 23:10:56,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:56,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088892476] [2019-12-18 23:10:56,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:10:56,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088892476] [2019-12-18 23:10:56,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:56,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:10:56,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68566479] [2019-12-18 23:10:56,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:10:56,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:10:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:56,923 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-18 23:10:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:57,137 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-18 23:10:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:10:57,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:10:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:57,145 INFO L225 Difference]: With dead ends: 1050 [2019-12-18 23:10:57,145 INFO L226 Difference]: Without dead ends: 1045 [2019-12-18 23:10:57,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:10:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-18 23:10:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-18 23:10:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 23:10:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-18 23:10:57,170 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-18 23:10:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:57,170 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-18 23:10:57,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:10:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-18 23:10:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:10:57,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:57,172 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:57,173 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:57,173 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-18 23:10:57,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:57,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225957627] [2019-12-18 23:10:57,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:10:57,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225957627] [2019-12-18 23:10:57,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:57,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:57,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382758731] [2019-12-18 23:10:57,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:57,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:57,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:57,271 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-18 23:10:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:57,364 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-18 23:10:57,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:57,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:10:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:57,372 INFO L225 Difference]: With dead ends: 736 [2019-12-18 23:10:57,372 INFO L226 Difference]: Without dead ends: 728 [2019-12-18 23:10:57,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-18 23:10:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-18 23:10:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 23:10:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-18 23:10:57,395 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-18 23:10:57,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:57,395 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-18 23:10:57,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-18 23:10:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 23:10:57,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:57,397 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:57,397 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:10:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-18 23:10:57,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:57,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205873362] [2019-12-18 23:10:57,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:10:57,459 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:10:57,459 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:10:57,460 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:10:57,460 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 23:10:57,484 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,484 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,484 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,485 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,485 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,485 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,486 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,486 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,486 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,487 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,487 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,488 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,488 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,488 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,488 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,488 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,489 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,489 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,489 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,489 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,490 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,490 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,490 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,490 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,491 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,491 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,491 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,492 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,492 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,492 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,494 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,494 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,494 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,494 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,495 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,495 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,495 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,495 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,495 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,495 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,496 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,496 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,496 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,496 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,497 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,497 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,497 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,497 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,497 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,498 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,498 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,498 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,498 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,499 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,500 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,500 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,500 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,501 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,501 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,501 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,501 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,502 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,502 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,502 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,502 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,502 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,503 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,503 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,503 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,503 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,503 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,504 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,504 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,505 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,506 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,506 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,506 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,506 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,508 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,508 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,508 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,508 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,508 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,510 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,510 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,510 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,510 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,510 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,512 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,512 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,512 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,513 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,513 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,514 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,515 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,515 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,515 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,515 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,516 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,527 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,528 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,528 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,529 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,537 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,538 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,538 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,538 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,538 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,539 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,542 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,543 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,543 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,543 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,543 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,543 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:10:57,546 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 23:10:57,547 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:10:57,547 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:10:57,547 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:10:57,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:10:57,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:10:57,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:10:57,548 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:10:57,548 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:10:57,551 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-18 23:10:57,551 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 23:10:57,599 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 23:10:57,599 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:57,603 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 56/171 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-18 23:10:57,614 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 23:10:57,651 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 23:10:57,652 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:10:57,655 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 56/171 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-18 23:10:57,663 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-18 23:10:57,663 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:10:59,089 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 23:10:59,447 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-18 23:10:59,447 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-18 23:10:59,448 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 23:10:59,552 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 23:10:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 23:10:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:10:59,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:59,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:10:59,553 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-18 23:10:59,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:59,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820864879] [2019-12-18 23:10:59,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:59,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 23:10:59,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820864879] [2019-12-18 23:10:59,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:59,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:10:59,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018180737] [2019-12-18 23:10:59,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:10:59,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:59,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:10:59,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:10:59,572 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 23:10:59,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:59,613 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 23:10:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:10:59,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:10:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:59,630 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 23:10:59,631 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 23:10:59,631 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 23:10:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 23:10:59,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 23:10:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 23:10:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 23:10:59,696 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 23:10:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:59,697 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 23:10:59,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:10:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 23:10:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:10:59,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:59,698 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:59,698 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-18 23:10:59,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:59,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763445672] [2019-12-18 23:10:59,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:10:59,736 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 23:10:59,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763445672] [2019-12-18 23:10:59,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:10:59,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:10:59,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980573246] [2019-12-18 23:10:59,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:10:59,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:10:59,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:10:59,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:10:59,739 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 23:10:59,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:10:59,826 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-18 23:10:59,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:10:59,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:10:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:10:59,849 INFO L225 Difference]: With dead ends: 2826 [2019-12-18 23:10:59,849 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 23:10:59,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:10:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 23:10:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-18 23:10:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 23:10:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 23:10:59,958 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 23:10:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:10:59,959 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 23:10:59,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:10:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 23:10:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:10:59,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:10:59,960 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:10:59,961 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:10:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:10:59,961 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-18 23:10:59,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:10:59,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936291907] [2019-12-18 23:10:59,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:10:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:00,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936291907] [2019-12-18 23:11:00,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:00,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:00,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622346127] [2019-12-18 23:11:00,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:00,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:00,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:00,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:00,015 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 23:11:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:00,147 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-18 23:11:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:00,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:11:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:00,196 INFO L225 Difference]: With dead ends: 3124 [2019-12-18 23:11:00,196 INFO L226 Difference]: Without dead ends: 3120 [2019-12-18 23:11:00,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-18 23:11:00,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-18 23:11:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 23:11:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 23:11:00,306 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 23:11:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:00,308 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 23:11:00,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 23:11:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:00,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,309 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:00,309 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:00,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-18 23:11:00,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:00,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831259651] [2019-12-18 23:11:00,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:00,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831259651] [2019-12-18 23:11:00,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015499636] [2019-12-18 23:11:00,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:00,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:00,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:00,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:00,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:00,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917309769] [2019-12-18 23:11:00,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:00,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:00,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:00,532 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 7 states. [2019-12-18 23:11:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:00,799 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-18 23:11:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:00,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:00,836 INFO L225 Difference]: With dead ends: 4460 [2019-12-18 23:11:00,836 INFO L226 Difference]: Without dead ends: 4456 [2019-12-18 23:11:00,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-18 23:11:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-18 23:11:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-18 23:11:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-18 23:11:00,959 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-18 23:11:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:00,959 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-18 23:11:00,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-18 23:11:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:00,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:00,960 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:01,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:01,166 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-18 23:11:01,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:01,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238715292] [2019-12-18 23:11:01,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:01,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238715292] [2019-12-18 23:11:01,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:01,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:01,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983058989] [2019-12-18 23:11:01,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:01,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:01,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:01,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:01,220 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-18 23:11:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:01,497 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-18 23:11:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:01,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:01,520 INFO L225 Difference]: With dead ends: 4522 [2019-12-18 23:11:01,520 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 23:11:01,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 23:11:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-18 23:11:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 23:11:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 23:11:01,631 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 23:11:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:01,632 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 23:11:01,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 23:11:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:11:01,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:01,634 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:01,634 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-18 23:11:01,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:01,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242310826] [2019-12-18 23:11:01,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:01,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242310826] [2019-12-18 23:11:01,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:01,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:01,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031504257] [2019-12-18 23:11:01,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:01,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:01,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:01,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:01,675 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 23:11:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:01,756 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-18 23:11:01,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:01,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:11:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:01,770 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 23:11:01,770 INFO L226 Difference]: Without dead ends: 3200 [2019-12-18 23:11:01,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-18 23:11:01,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-18 23:11:01,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 23:11:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 23:11:01,913 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 23:11:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:01,913 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 23:11:01,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 23:11:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:01,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:01,915 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:01,915 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-18 23:11:01,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:01,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526659731] [2019-12-18 23:11:01,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:01,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526659731] [2019-12-18 23:11:01,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41131447] [2019-12-18 23:11:01,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:02,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:02,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:02,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:02,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571664162] [2019-12-18 23:11:02,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:02,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:02,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:02,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:02,074 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 7 states. [2019-12-18 23:11:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:02,295 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-18 23:11:02,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:02,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:02,313 INFO L225 Difference]: With dead ends: 4759 [2019-12-18 23:11:02,313 INFO L226 Difference]: Without dead ends: 4753 [2019-12-18 23:11:02,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-18 23:11:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-18 23:11:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-18 23:11:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-18 23:11:02,413 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-18 23:11:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:02,413 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-18 23:11:02,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-18 23:11:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:02,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:02,415 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:02,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:02,619 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-18 23:11:02,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:02,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196036072] [2019-12-18 23:11:02,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:02,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196036072] [2019-12-18 23:11:02,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696489567] [2019-12-18 23:11:02,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:02,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:02,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:02,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:02,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:02,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859640727] [2019-12-18 23:11:02,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:02,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:02,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:02,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:02,748 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 7 states. [2019-12-18 23:11:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:02,963 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-18 23:11:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:02,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:02,982 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 23:11:02,982 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 23:11:02,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 23:11:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-18 23:11:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-18 23:11:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-18 23:11:03,090 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-18 23:11:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:03,090 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-18 23:11:03,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-18 23:11:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:03,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:03,092 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:03,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:03,302 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-18 23:11:03,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:03,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874176119] [2019-12-18 23:11:03,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:03,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874176119] [2019-12-18 23:11:03,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:03,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:03,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776070655] [2019-12-18 23:11:03,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:03,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:03,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:03,360 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-18 23:11:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:03,641 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-18 23:11:03,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:03,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:03,659 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 23:11:03,659 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 23:11:03,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 23:11:03,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-18 23:11:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-18 23:11:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-18 23:11:03,744 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-18 23:11:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:03,745 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-18 23:11:03,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-18 23:11:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:03,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:03,747 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:03,747 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:03,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:03,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-18 23:11:03,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:03,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83147364] [2019-12-18 23:11:03,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:03,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83147364] [2019-12-18 23:11:03,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:03,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:03,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742332973] [2019-12-18 23:11:03,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:03,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:03,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:03,808 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-18 23:11:03,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:03,991 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-18 23:11:03,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:03,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:03,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:04,010 INFO L225 Difference]: With dead ends: 4737 [2019-12-18 23:11:04,010 INFO L226 Difference]: Without dead ends: 4728 [2019-12-18 23:11:04,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-18 23:11:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-18 23:11:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-18 23:11:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-18 23:11:04,092 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-18 23:11:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:04,092 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-18 23:11:04,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-18 23:11:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:04,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:04,094 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:04,095 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:04,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:04,095 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-18 23:11:04,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:04,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665421681] [2019-12-18 23:11:04,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:04,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665421681] [2019-12-18 23:11:04,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740671304] [2019-12-18 23:11:04,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:04,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:04,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:04,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:04,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:04,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440271110] [2019-12-18 23:11:04,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:04,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:04,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:04,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:04,298 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 9 states. [2019-12-18 23:11:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:04,885 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-18 23:11:04,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:04,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:04,905 INFO L225 Difference]: With dead ends: 5995 [2019-12-18 23:11:04,905 INFO L226 Difference]: Without dead ends: 5991 [2019-12-18 23:11:04,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-18 23:11:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-18 23:11:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-18 23:11:05,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-18 23:11:05,001 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-18 23:11:05,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:05,001 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-18 23:11:05,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-18 23:11:05,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:05,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:05,003 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:05,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:05,216 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-18 23:11:05,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:05,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506865161] [2019-12-18 23:11:05,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:05,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506865161] [2019-12-18 23:11:05,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540386520] [2019-12-18 23:11:05,285 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:05,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:05,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:05,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:05,357 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 23:11:05,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:05,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:05,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136920746] [2019-12-18 23:11:05,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:05,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:05,363 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 9 states. [2019-12-18 23:11:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:05,929 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-18 23:11:05,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:05,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:05,940 INFO L225 Difference]: With dead ends: 5889 [2019-12-18 23:11:05,941 INFO L226 Difference]: Without dead ends: 5883 [2019-12-18 23:11:05,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-18 23:11:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-18 23:11:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-18 23:11:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-18 23:11:06,034 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-18 23:11:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:06,034 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-18 23:11:06,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-18 23:11:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:06,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:06,037 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:06,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:06,242 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:06,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-18 23:11:06,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:06,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983904940] [2019-12-18 23:11:06,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:06,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983904940] [2019-12-18 23:11:06,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697885396] [2019-12-18 23:11:06,328 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:06,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:11:06,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:06,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:06,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:06,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:06,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:06,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526105944] [2019-12-18 23:11:06,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:06,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:06,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:06,404 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 9 states. [2019-12-18 23:11:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:07,028 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-18 23:11:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:07,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:07,045 INFO L225 Difference]: With dead ends: 5888 [2019-12-18 23:11:07,045 INFO L226 Difference]: Without dead ends: 5884 [2019-12-18 23:11:07,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-18 23:11:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-18 23:11:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-18 23:11:07,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-18 23:11:07,141 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-18 23:11:07,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:07,142 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-18 23:11:07,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-18 23:11:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:07,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:07,144 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:07,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:07,352 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:07,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-18 23:11:07,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:07,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976230592] [2019-12-18 23:11:07,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:07,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976230592] [2019-12-18 23:11:07,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336256706] [2019-12-18 23:11:07,408 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:07,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:07,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:07,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:07,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:07,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:07,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:07,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039068585] [2019-12-18 23:11:07,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:07,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:07,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:07,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:07,499 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 9 states. [2019-12-18 23:11:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:08,015 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-18 23:11:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:08,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:08,024 INFO L225 Difference]: With dead ends: 5819 [2019-12-18 23:11:08,025 INFO L226 Difference]: Without dead ends: 5813 [2019-12-18 23:11:08,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-18 23:11:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-18 23:11:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-18 23:11:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-18 23:11:08,099 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-18 23:11:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:08,100 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-18 23:11:08,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:08,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-18 23:11:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:08,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:08,102 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:08,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:08,306 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:08,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-18 23:11:08,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:08,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715131872] [2019-12-18 23:11:08,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:08,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715131872] [2019-12-18 23:11:08,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:08,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:08,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725613292] [2019-12-18 23:11:08,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:08,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:08,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:08,348 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-18 23:11:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:08,441 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-18 23:11:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:08,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 23:11:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:08,451 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 23:11:08,451 INFO L226 Difference]: Without dead ends: 2994 [2019-12-18 23:11:08,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-18 23:11:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-18 23:11:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-18 23:11:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-18 23:11:08,515 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-18 23:11:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:08,516 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-18 23:11:08,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-18 23:11:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:08,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:08,518 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:08,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:08,518 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-18 23:11:08,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:08,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977054703] [2019-12-18 23:11:08,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:08,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977054703] [2019-12-18 23:11:08,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:08,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:08,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527186215] [2019-12-18 23:11:08,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:08,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:08,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:08,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:08,577 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-18 23:11:09,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:09,090 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-18 23:11:09,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:09,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:09,101 INFO L225 Difference]: With dead ends: 6140 [2019-12-18 23:11:09,102 INFO L226 Difference]: Without dead ends: 6133 [2019-12-18 23:11:09,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-18 23:11:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-18 23:11:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-18 23:11:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-18 23:11:09,182 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-18 23:11:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:09,183 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-18 23:11:09,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-18 23:11:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:09,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:09,185 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:09,185 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-18 23:11:09,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:09,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081265681] [2019-12-18 23:11:09,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:09,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081265681] [2019-12-18 23:11:09,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:09,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:09,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640879007] [2019-12-18 23:11:09,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:09,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:09,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:09,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:09,251 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-18 23:11:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:09,718 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-18 23:11:09,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:09,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:09,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:09,729 INFO L225 Difference]: With dead ends: 6012 [2019-12-18 23:11:09,729 INFO L226 Difference]: Without dead ends: 6002 [2019-12-18 23:11:09,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:09,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-18 23:11:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-18 23:11:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-18 23:11:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-18 23:11:09,801 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-18 23:11:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:09,801 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-18 23:11:09,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-18 23:11:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 23:11:09,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:09,803 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:09,804 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 23:11:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:09,804 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-18 23:11:09,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:09,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098448895] [2019-12-18 23:11:09,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:09,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:11:09,825 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:11:09,825 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:11:09,825 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 23:11:09,837 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,837 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,838 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,842 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,842 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,842 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,842 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,842 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,842 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,842 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,843 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,844 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,844 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,844 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,844 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,844 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,844 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,845 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,845 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,845 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,845 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,845 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,845 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,846 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,846 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,846 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,846 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,846 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,846 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,846 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,848 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,848 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,850 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,850 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,852 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,852 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,852 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,853 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,853 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,853 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,853 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,853 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,860 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,860 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,862 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,862 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,864 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:09,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 23:11:09,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:11:09,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:11:09,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:11:09,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:11:09,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:11:09,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:11:09,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:11:09,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:11:09,873 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-18 23:11:09,873 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 23:11:09,889 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 23:11:09,890 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:09,892 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 80/215 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-18 23:11:09,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 23:11:09,914 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 23:11:09,915 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:09,917 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 80/215 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-18 23:11:09,924 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-18 23:11:09,924 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:11:11,338 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 23:11:11,813 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-18 23:11:11,813 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 23:11:11,814 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-18 23:11:12,125 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-18 23:11:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-18 23:11:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:11:12,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:12,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:11:12,126 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-18 23:11:12,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:12,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887204382] [2019-12-18 23:11:12,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:12,147 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 23:11:12,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887204382] [2019-12-18 23:11:12,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:12,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:11:12,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648915619] [2019-12-18 23:11:12,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:11:12,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:12,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:11:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:11:12,150 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-18 23:11:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:12,217 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-18 23:11:12,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:11:12,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:11:12,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:12,240 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 23:11:12,240 INFO L226 Difference]: Without dead ends: 5479 [2019-12-18 23:11:12,242 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 23:11:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-18 23:11:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-18 23:11:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 23:11:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-18 23:11:12,455 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-18 23:11:12,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:12,455 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-18 23:11:12,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:11:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-18 23:11:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:11:12,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:12,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:12,456 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-18 23:11:12,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:12,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122793143] [2019-12-18 23:11:12,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:12,478 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 23:11:12,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122793143] [2019-12-18 23:11:12,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:12,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:12,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478094749] [2019-12-18 23:11:12,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:12,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:12,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:12,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:12,479 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-18 23:11:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:12,592 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-18 23:11:12,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:12,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:11:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:12,614 INFO L225 Difference]: With dead ends: 9358 [2019-12-18 23:11:12,614 INFO L226 Difference]: Without dead ends: 9355 [2019-12-18 23:11:12,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:12,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-18 23:11:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-18 23:11:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-18 23:11:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-18 23:11:12,809 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-18 23:11:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:12,809 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-18 23:11:12,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-18 23:11:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:11:12,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:12,809 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:12,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-18 23:11:12,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:12,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226601451] [2019-12-18 23:11:12,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:12,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:12,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226601451] [2019-12-18 23:11:12,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:12,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:12,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109087220] [2019-12-18 23:11:12,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:12,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:12,832 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-18 23:11:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:12,957 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-18 23:11:12,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:12,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:11:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:12,990 INFO L225 Difference]: With dead ends: 10720 [2019-12-18 23:11:12,991 INFO L226 Difference]: Without dead ends: 10716 [2019-12-18 23:11:12,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-18 23:11:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-18 23:11:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 23:11:13,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-18 23:11:13,181 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-18 23:11:13,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:13,182 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-18 23:11:13,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:13,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-18 23:11:13,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:13,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:13,183 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:13,183 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-18 23:11:13,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:13,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651891557] [2019-12-18 23:11:13,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:13,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651891557] [2019-12-18 23:11:13,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784099574] [2019-12-18 23:11:13,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:13,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:13,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:11:13,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:13,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:13,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678425623] [2019-12-18 23:11:13,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:13,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:13,923 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 7 states. [2019-12-18 23:11:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:14,222 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-18 23:11:14,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:14,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:14,276 INFO L225 Difference]: With dead ends: 16250 [2019-12-18 23:11:14,277 INFO L226 Difference]: Without dead ends: 16246 [2019-12-18 23:11:14,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-18 23:11:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-18 23:11:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-18 23:11:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-18 23:11:14,542 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-18 23:11:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:14,542 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-18 23:11:14,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-18 23:11:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:11:14,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:14,543 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:14,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:14,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:14,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:14,745 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-18 23:11:14,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:14,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258868593] [2019-12-18 23:11:14,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:14,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258868593] [2019-12-18 23:11:14,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:14,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:14,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375269382] [2019-12-18 23:11:14,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:14,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:14,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:14,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:14,792 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-18 23:11:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:15,047 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-18 23:11:15,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:15,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:11:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:15,084 INFO L225 Difference]: With dead ends: 16584 [2019-12-18 23:11:15,084 INFO L226 Difference]: Without dead ends: 16579 [2019-12-18 23:11:15,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-18 23:11:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-18 23:11:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-18 23:11:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-18 23:11:15,396 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-18 23:11:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:15,397 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-18 23:11:15,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-18 23:11:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:11:15,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:15,397 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:15,397 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-18 23:11:15,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:15,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058718489] [2019-12-18 23:11:15,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:15,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058718489] [2019-12-18 23:11:15,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:15,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:15,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860393369] [2019-12-18 23:11:15,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:15,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:15,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:15,432 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-18 23:11:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:15,559 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-18 23:11:15,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:15,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:11:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:15,599 INFO L225 Difference]: With dead ends: 11876 [2019-12-18 23:11:15,599 INFO L226 Difference]: Without dead ends: 11868 [2019-12-18 23:11:15,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-18 23:11:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-18 23:11:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-18 23:11:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-18 23:11:15,929 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-18 23:11:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:15,929 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-18 23:11:15,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-18 23:11:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:15,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:15,931 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:15,931 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-18 23:11:15,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:15,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251976538] [2019-12-18 23:11:15,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:15,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251976538] [2019-12-18 23:11:15,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795241140] [2019-12-18 23:11:15,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:16,118 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:16,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:16,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:16,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:16,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951368376] [2019-12-18 23:11:16,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:16,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:16,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:16,129 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 7 states. [2019-12-18 23:11:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:16,563 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-18 23:11:16,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:16,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:16,631 INFO L225 Difference]: With dead ends: 18509 [2019-12-18 23:11:16,631 INFO L226 Difference]: Without dead ends: 18503 [2019-12-18 23:11:16,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-18 23:11:17,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-18 23:11:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-18 23:11:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-18 23:11:17,122 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-18 23:11:17,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:17,122 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-18 23:11:17,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-18 23:11:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:17,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:17,123 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:17,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:17,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-18 23:11:17,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:17,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916004512] [2019-12-18 23:11:17,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:17,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916004512] [2019-12-18 23:11:17,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439192586] [2019-12-18 23:11:17,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:17,448 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:17,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:17,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:17,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:17,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836997162] [2019-12-18 23:11:17,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:17,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:17,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:17,454 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-18 23:11:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:17,802 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-18 23:11:17,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:17,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:17,880 INFO L225 Difference]: With dead ends: 19158 [2019-12-18 23:11:17,880 INFO L226 Difference]: Without dead ends: 19149 [2019-12-18 23:11:17,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-18 23:11:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-18 23:11:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-18 23:11:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-18 23:11:18,212 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-18 23:11:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:18,212 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-18 23:11:18,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-18 23:11:18,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:18,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:18,213 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:18,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:18,414 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-18 23:11:18,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:18,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188850957] [2019-12-18 23:11:18,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:18,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188850957] [2019-12-18 23:11:18,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:18,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:18,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412807563] [2019-12-18 23:11:18,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:18,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:18,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:18,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:18,467 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-18 23:11:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:18,837 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-18 23:11:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:18,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:19,608 INFO L225 Difference]: With dead ends: 19350 [2019-12-18 23:11:19,608 INFO L226 Difference]: Without dead ends: 19341 [2019-12-18 23:11:19,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-18 23:11:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-18 23:11:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-18 23:11:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-18 23:11:19,883 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-18 23:11:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:19,883 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-18 23:11:19,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-18 23:11:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:11:19,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:19,884 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:19,884 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-18 23:11:19,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:19,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796120210] [2019-12-18 23:11:19,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:19,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796120210] [2019-12-18 23:11:19,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:19,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:19,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261046756] [2019-12-18 23:11:19,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:19,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:19,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:19,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:19,923 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-18 23:11:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:20,171 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-18 23:11:20,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:20,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:11:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:20,214 INFO L225 Difference]: With dead ends: 19087 [2019-12-18 23:11:20,214 INFO L226 Difference]: Without dead ends: 19078 [2019-12-18 23:11:20,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-18 23:11:20,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-18 23:11:20,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-18 23:11:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-18 23:11:20,456 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-18 23:11:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:20,457 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-18 23:11:20,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-18 23:11:20,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:20,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:20,458 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:20,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:20,459 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-18 23:11:20,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:20,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577164217] [2019-12-18 23:11:20,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:20,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577164217] [2019-12-18 23:11:20,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314598687] [2019-12-18 23:11:20,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:20,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:20,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:20,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:20,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:20,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720490879] [2019-12-18 23:11:20,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:20,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:20,590 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 9 states. [2019-12-18 23:11:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:21,352 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-18 23:11:21,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:21,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:21,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:21,415 INFO L225 Difference]: With dead ends: 26399 [2019-12-18 23:11:21,415 INFO L226 Difference]: Without dead ends: 26395 [2019-12-18 23:11:21,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:21,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-18 23:11:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 7999. [2019-12-18 23:11:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-18 23:11:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-18 23:11:21,723 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-18 23:11:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:21,723 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-18 23:11:21,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-18 23:11:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:21,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:21,724 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:21,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:21,925 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:21,925 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-18 23:11:21,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:21,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132639171] [2019-12-18 23:11:21,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:21,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:21,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132639171] [2019-12-18 23:11:21,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686085674] [2019-12-18 23:11:21,991 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:22,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:22,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:22,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:22,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:22,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:22,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:22,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637129321] [2019-12-18 23:11:22,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:22,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:22,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:22,083 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 9 states. [2019-12-18 23:11:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:22,736 INFO L93 Difference]: Finished difference Result 26109 states and 99244 transitions. [2019-12-18 23:11:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:22,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:22,795 INFO L225 Difference]: With dead ends: 26109 [2019-12-18 23:11:22,795 INFO L226 Difference]: Without dead ends: 26103 [2019-12-18 23:11:22,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2019-12-18 23:11:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 7893. [2019-12-18 23:11:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-18 23:11:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-18 23:11:23,231 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-18 23:11:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:23,232 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-18 23:11:23,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-18 23:11:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:23,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:23,233 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:23,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:23,433 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-18 23:11:23,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:23,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128449151] [2019-12-18 23:11:23,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:23,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128449151] [2019-12-18 23:11:23,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531973484] [2019-12-18 23:11:23,483 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:23,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:11:23,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:23,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:23,567 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:23,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:23,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:23,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056991305] [2019-12-18 23:11:23,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:23,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:23,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:23,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:23,572 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-18 23:11:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:24,206 INFO L93 Difference]: Finished difference Result 26144 states and 99382 transitions. [2019-12-18 23:11:24,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:24,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:24,266 INFO L225 Difference]: With dead ends: 26144 [2019-12-18 23:11:24,266 INFO L226 Difference]: Without dead ends: 26140 [2019-12-18 23:11:24,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26140 states. [2019-12-18 23:11:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26140 to 7675. [2019-12-18 23:11:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-18 23:11:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-18 23:11:24,540 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-18 23:11:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:24,540 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-18 23:11:24,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-18 23:11:24,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:24,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:24,542 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:24,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:24,742 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:24,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-18 23:11:24,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:24,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121373727] [2019-12-18 23:11:24,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:24,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121373727] [2019-12-18 23:11:24,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037070000] [2019-12-18 23:11:24,808 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:24,884 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:24,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:24,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:24,887 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:11:24,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:24,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:24,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377122818] [2019-12-18 23:11:24,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:24,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:24,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:24,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:24,892 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 9 states. [2019-12-18 23:11:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:25,735 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-18 23:11:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:25,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:25,994 INFO L225 Difference]: With dead ends: 25959 [2019-12-18 23:11:25,994 INFO L226 Difference]: Without dead ends: 25953 [2019-12-18 23:11:25,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-18 23:11:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-18 23:11:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-18 23:11:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-18 23:11:26,522 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-18 23:11:26,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:26,523 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-18 23:11:26,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-18 23:11:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:26,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:26,525 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:26,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:26,733 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-18 23:11:26,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:26,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798875480] [2019-12-18 23:11:26,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:26,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798875480] [2019-12-18 23:11:26,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:26,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:26,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820449387] [2019-12-18 23:11:26,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:26,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:26,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:26,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:26,759 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-18 23:11:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:26,878 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-18 23:11:26,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:26,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 23:11:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:26,910 INFO L225 Difference]: With dead ends: 12952 [2019-12-18 23:11:26,910 INFO L226 Difference]: Without dead ends: 12936 [2019-12-18 23:11:26,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-18 23:11:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-18 23:11:27,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-18 23:11:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-18 23:11:27,105 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-18 23:11:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:27,105 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-18 23:11:27,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-18 23:11:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:27,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:27,107 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:27,107 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-18 23:11:27,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:27,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615961924] [2019-12-18 23:11:27,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:27,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615961924] [2019-12-18 23:11:27,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:27,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:27,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041099563] [2019-12-18 23:11:27,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:27,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:27,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:27,159 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-18 23:11:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:27,773 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-18 23:11:27,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:27,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:27,842 INFO L225 Difference]: With dead ends: 29252 [2019-12-18 23:11:27,842 INFO L226 Difference]: Without dead ends: 29245 [2019-12-18 23:11:27,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-18 23:11:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-18 23:11:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 23:11:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-18 23:11:28,329 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-18 23:11:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:28,330 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-18 23:11:28,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-18 23:11:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:11:28,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:28,331 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:28,331 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-18 23:11:28,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:28,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51003869] [2019-12-18 23:11:28,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:28,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51003869] [2019-12-18 23:11:28,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:28,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:28,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201422298] [2019-12-18 23:11:28,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:28,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:28,387 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-18 23:11:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:29,079 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-18 23:11:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:29,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:11:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:29,141 INFO L225 Difference]: With dead ends: 28866 [2019-12-18 23:11:29,141 INFO L226 Difference]: Without dead ends: 28856 [2019-12-18 23:11:29,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-18 23:11:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-18 23:11:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-18 23:11:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-18 23:11:29,447 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-18 23:11:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:29,447 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-18 23:11:29,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-18 23:11:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:29,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:29,449 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:29,449 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:29,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:29,449 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-18 23:11:29,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:29,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013710724] [2019-12-18 23:11:29,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:29,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013710724] [2019-12-18 23:11:29,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860139398] [2019-12-18 23:11:29,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:29,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:29,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:29,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:29,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:29,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542761584] [2019-12-18 23:11:29,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:29,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:29,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:29,562 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 7 states. [2019-12-18 23:11:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:29,861 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-18 23:11:29,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:29,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:29,906 INFO L225 Difference]: With dead ends: 19371 [2019-12-18 23:11:29,906 INFO L226 Difference]: Without dead ends: 19359 [2019-12-18 23:11:29,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-18 23:11:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-18 23:11:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 23:11:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-18 23:11:30,297 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-18 23:11:30,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:30,298 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-18 23:11:30,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:30,298 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-18 23:11:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:30,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:30,300 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:30,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:30,501 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-18 23:11:30,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:30,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252696315] [2019-12-18 23:11:30,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:30,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252696315] [2019-12-18 23:11:30,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471943510] [2019-12-18 23:11:30,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:30,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:11:30,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:30,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:30,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:11:30,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874737886] [2019-12-18 23:11:30,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:30,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:30,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:30,620 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 7 states. [2019-12-18 23:11:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:30,931 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-18 23:11:30,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:30,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:30,977 INFO L225 Difference]: With dead ends: 20331 [2019-12-18 23:11:30,977 INFO L226 Difference]: Without dead ends: 20317 [2019-12-18 23:11:30,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:31,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-18 23:11:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-18 23:11:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-18 23:11:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-18 23:11:31,226 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-18 23:11:31,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:31,226 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-18 23:11:31,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:31,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-18 23:11:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:31,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:31,228 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:31,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:31,429 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:31,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:31,429 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-18 23:11:31,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:31,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588465803] [2019-12-18 23:11:31,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:31,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588465803] [2019-12-18 23:11:31,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:31,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968019280] [2019-12-18 23:11:31,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:31,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:31,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:31,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:31,467 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-18 23:11:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:31,749 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-18 23:11:31,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:31,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:31,796 INFO L225 Difference]: With dead ends: 20594 [2019-12-18 23:11:31,796 INFO L226 Difference]: Without dead ends: 20575 [2019-12-18 23:11:31,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-18 23:11:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-18 23:11:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-18 23:11:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-18 23:11:32,055 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-18 23:11:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:32,056 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-18 23:11:32,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-18 23:11:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:32,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:32,058 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:32,058 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:32,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:32,058 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-18 23:11:32,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:32,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954870102] [2019-12-18 23:11:32,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:32,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954870102] [2019-12-18 23:11:32,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:32,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:32,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508974638] [2019-12-18 23:11:32,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:32,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:32,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:32,103 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-18 23:11:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:32,348 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-18 23:11:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:32,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:32,398 INFO L225 Difference]: With dead ends: 20360 [2019-12-18 23:11:32,398 INFO L226 Difference]: Without dead ends: 20341 [2019-12-18 23:11:32,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-18 23:11:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-18 23:11:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 23:11:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-18 23:11:32,787 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-18 23:11:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:32,787 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-18 23:11:32,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-18 23:11:32,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:32,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:32,789 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:32,789 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-18 23:11:32,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:32,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368990216] [2019-12-18 23:11:32,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:32,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368990216] [2019-12-18 23:11:32,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:32,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:32,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818554984] [2019-12-18 23:11:32,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:32,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:32,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:32,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:32,823 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-18 23:11:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:33,105 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-18 23:11:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:33,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:33,150 INFO L225 Difference]: With dead ends: 20740 [2019-12-18 23:11:33,150 INFO L226 Difference]: Without dead ends: 20721 [2019-12-18 23:11:33,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:33,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-18 23:11:33,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-18 23:11:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-18 23:11:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-18 23:11:33,395 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-18 23:11:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:33,395 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-18 23:11:33,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-18 23:11:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:11:33,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:33,397 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:33,397 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-18 23:11:33,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:33,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691134753] [2019-12-18 23:11:33,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:33,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691134753] [2019-12-18 23:11:33,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:33,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:11:33,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016279632] [2019-12-18 23:11:33,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:11:33,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:33,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:11:33,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:33,441 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 7 states. [2019-12-18 23:11:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:33,721 INFO L93 Difference]: Finished difference Result 20896 states and 85782 transitions. [2019-12-18 23:11:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:11:33,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:11:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:33,772 INFO L225 Difference]: With dead ends: 20896 [2019-12-18 23:11:33,772 INFO L226 Difference]: Without dead ends: 20877 [2019-12-18 23:11:33,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:11:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-18 23:11:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 9286. [2019-12-18 23:11:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-18 23:11:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-18 23:11:34,035 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-18 23:11:34,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:34,036 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-18 23:11:34,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:11:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-18 23:11:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:34,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:34,039 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:34,039 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:34,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:34,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-18 23:11:34,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:34,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899375901] [2019-12-18 23:11:34,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:34,089 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:34,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899375901] [2019-12-18 23:11:34,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060678123] [2019-12-18 23:11:34,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:34,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:34,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:34,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:34,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:34,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311602705] [2019-12-18 23:11:34,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:34,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:34,180 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 9 states. [2019-12-18 23:11:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:34,860 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-18 23:11:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:34,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:35,085 INFO L225 Difference]: With dead ends: 29793 [2019-12-18 23:11:35,086 INFO L226 Difference]: Without dead ends: 29783 [2019-12-18 23:11:35,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:35,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-18 23:11:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9200. [2019-12-18 23:11:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-18 23:11:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-18 23:11:35,399 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-18 23:11:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:35,400 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-18 23:11:35,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-18 23:11:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:35,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:35,403 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:35,603 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:35,604 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-18 23:11:35,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:35,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162524942] [2019-12-18 23:11:35,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:35,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162524942] [2019-12-18 23:11:35,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528014504] [2019-12-18 23:11:35,654 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:35,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:35,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:35,748 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:35,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:35,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:35,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:35,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250211] [2019-12-18 23:11:35,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:35,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:35,754 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 9 states. [2019-12-18 23:11:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:36,439 INFO L93 Difference]: Finished difference Result 29319 states and 113201 transitions. [2019-12-18 23:11:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:36,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:36,509 INFO L225 Difference]: With dead ends: 29319 [2019-12-18 23:11:36,509 INFO L226 Difference]: Without dead ends: 29308 [2019-12-18 23:11:36,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29308 states. [2019-12-18 23:11:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29308 to 9197. [2019-12-18 23:11:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-18 23:11:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-18 23:11:36,857 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-18 23:11:36,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:36,857 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-18 23:11:36,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:36,857 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-18 23:11:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:36,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:36,860 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:37,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:37,061 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-18 23:11:37,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:37,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900765675] [2019-12-18 23:11:37,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:37,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900765675] [2019-12-18 23:11:37,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747728148] [2019-12-18 23:11:37,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:37,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:37,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:37,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:37,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:37,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353102228] [2019-12-18 23:11:37,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:37,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:37,194 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 9 states. [2019-12-18 23:11:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:37,806 INFO L93 Difference]: Finished difference Result 28997 states and 111934 transitions. [2019-12-18 23:11:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:37,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:37,869 INFO L225 Difference]: With dead ends: 28997 [2019-12-18 23:11:37,869 INFO L226 Difference]: Without dead ends: 28987 [2019-12-18 23:11:37,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28987 states. [2019-12-18 23:11:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28987 to 9121. [2019-12-18 23:11:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-18 23:11:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-18 23:11:38,347 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-18 23:11:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:38,347 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-18 23:11:38,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-18 23:11:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:38,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:38,350 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:38,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:38,552 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-18 23:11:38,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:38,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677217940] [2019-12-18 23:11:38,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:38,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677217940] [2019-12-18 23:11:38,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897784996] [2019-12-18 23:11:38,605 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:38,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:38,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:38,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:38,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:11:38,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:38,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:38,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545140405] [2019-12-18 23:11:38,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:38,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:38,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:38,687 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 9 states. [2019-12-18 23:11:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:39,344 INFO L93 Difference]: Finished difference Result 28781 states and 111002 transitions. [2019-12-18 23:11:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:39,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:39,405 INFO L225 Difference]: With dead ends: 28781 [2019-12-18 23:11:39,406 INFO L226 Difference]: Without dead ends: 28770 [2019-12-18 23:11:39,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-18 23:11:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 9044. [2019-12-18 23:11:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-18 23:11:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-18 23:11:39,724 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-18 23:11:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:39,725 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-18 23:11:39,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-18 23:11:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:39,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:39,728 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:39,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:39,929 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-18 23:11:39,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:39,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860177572] [2019-12-18 23:11:39,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 23:11:39,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860177572] [2019-12-18 23:11:39,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901378934] [2019-12-18 23:11:39,978 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:40,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 23:11:40,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:40,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:40,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 23:11:40,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:40,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:40,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170928353] [2019-12-18 23:11:40,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:40,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:40,063 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 9 states. [2019-12-18 23:11:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:40,694 INFO L93 Difference]: Finished difference Result 28747 states and 110799 transitions. [2019-12-18 23:11:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:40,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:40,757 INFO L225 Difference]: With dead ends: 28747 [2019-12-18 23:11:40,757 INFO L226 Difference]: Without dead ends: 28737 [2019-12-18 23:11:40,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-18 23:11:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 8874. [2019-12-18 23:11:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-18 23:11:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-18 23:11:41,080 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-18 23:11:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:41,080 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-18 23:11:41,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-18 23:11:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:41,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:41,084 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:41,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:41,284 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-18 23:11:41,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:41,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735502652] [2019-12-18 23:11:41,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:41,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735502652] [2019-12-18 23:11:41,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286941656] [2019-12-18 23:11:41,353 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:41,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:11:41,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:41,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:41,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:41,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:41,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:41,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186301876] [2019-12-18 23:11:41,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:41,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:41,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:41,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:41,456 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 9 states. [2019-12-18 23:11:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:42,205 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-18 23:11:42,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:42,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:42,275 INFO L225 Difference]: With dead ends: 28993 [2019-12-18 23:11:42,275 INFO L226 Difference]: Without dead ends: 28982 [2019-12-18 23:11:42,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-18 23:11:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-18 23:11:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-18 23:11:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-18 23:11:42,615 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-18 23:11:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:42,616 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-18 23:11:42,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-18 23:11:42,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:42,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:42,619 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:42,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:42,820 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:42,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-18 23:11:42,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:42,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317321623] [2019-12-18 23:11:42,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:42,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317321623] [2019-12-18 23:11:42,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803847602] [2019-12-18 23:11:42,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:42,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:42,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:42,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:42,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:42,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:42,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906999883] [2019-12-18 23:11:42,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:42,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:42,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:42,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:42,954 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 9 states. [2019-12-18 23:11:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:43,672 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-18 23:11:43,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:43,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:43,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:43,739 INFO L225 Difference]: With dead ends: 28840 [2019-12-18 23:11:43,739 INFO L226 Difference]: Without dead ends: 28830 [2019-12-18 23:11:43,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-18 23:11:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-18 23:11:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-18 23:11:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-18 23:11:44,083 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-18 23:11:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:44,083 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-18 23:11:44,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-18 23:11:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:44,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:44,086 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:44,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:44,287 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:44,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-18 23:11:44,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:44,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098975813] [2019-12-18 23:11:44,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:44,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098975813] [2019-12-18 23:11:44,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111960237] [2019-12-18 23:11:44,334 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:44,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:11:44,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:11:44,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:11:44,411 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:11:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 23:11:44,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:11:44,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:11:44,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807939429] [2019-12-18 23:11:44,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:44,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:44,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:44,416 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 9 states. [2019-12-18 23:11:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:45,112 INFO L93 Difference]: Finished difference Result 28552 states and 110204 transitions. [2019-12-18 23:11:45,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:45,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:45,173 INFO L225 Difference]: With dead ends: 28552 [2019-12-18 23:11:45,173 INFO L226 Difference]: Without dead ends: 28538 [2019-12-18 23:11:45,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-18 23:11:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8722. [2019-12-18 23:11:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-18 23:11:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-18 23:11:45,621 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-18 23:11:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:45,621 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-18 23:11:45,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-18 23:11:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:45,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:45,625 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:45,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:11:45,826 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-18 23:11:45,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:45,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070127841] [2019-12-18 23:11:45,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:45,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070127841] [2019-12-18 23:11:45,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:45,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:45,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263082683] [2019-12-18 23:11:45,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:45,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:45,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:45,877 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-18 23:11:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:46,549 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-18 23:11:46,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:46,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:46,609 INFO L225 Difference]: With dead ends: 28362 [2019-12-18 23:11:46,609 INFO L226 Difference]: Without dead ends: 28352 [2019-12-18 23:11:46,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-18 23:11:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-18 23:11:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-18 23:11:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-18 23:11:46,912 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-18 23:11:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:46,913 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-18 23:11:46,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-18 23:11:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:46,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:46,916 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:46,916 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-18 23:11:46,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:46,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297285964] [2019-12-18 23:11:46,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:46,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297285964] [2019-12-18 23:11:46,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:46,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:46,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034822397] [2019-12-18 23:11:46,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:46,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:46,971 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-18 23:11:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:47,659 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-18 23:11:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:47,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:47,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:47,728 INFO L225 Difference]: With dead ends: 28156 [2019-12-18 23:11:47,728 INFO L226 Difference]: Without dead ends: 28146 [2019-12-18 23:11:47,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-18 23:11:48,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-18 23:11:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-18 23:11:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-18 23:11:48,028 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-18 23:11:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:48,029 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-18 23:11:48,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-18 23:11:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:48,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:48,032 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:48,032 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-18 23:11:48,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:48,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732192973] [2019-12-18 23:11:48,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:48,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732192973] [2019-12-18 23:11:48,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:48,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:48,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121646455] [2019-12-18 23:11:48,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:48,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:48,085 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-18 23:11:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:48,707 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-18 23:11:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:48,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:48,769 INFO L225 Difference]: With dead ends: 27714 [2019-12-18 23:11:48,769 INFO L226 Difference]: Without dead ends: 27700 [2019-12-18 23:11:48,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-18 23:11:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-18 23:11:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-18 23:11:49,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-18 23:11:49,103 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-18 23:11:49,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:49,104 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-18 23:11:49,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-18 23:11:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:49,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:49,108 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:49,108 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-18 23:11:49,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:49,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237354297] [2019-12-18 23:11:49,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:49,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:49,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237354297] [2019-12-18 23:11:49,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:49,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:49,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797589053] [2019-12-18 23:11:49,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:49,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:49,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:49,171 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-18 23:11:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:49,877 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-18 23:11:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:49,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:49,935 INFO L225 Difference]: With dead ends: 27553 [2019-12-18 23:11:49,935 INFO L226 Difference]: Without dead ends: 27543 [2019-12-18 23:11:49,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-18 23:11:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-18 23:11:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-18 23:11:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-18 23:11:50,219 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-18 23:11:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:50,220 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-18 23:11:50,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-18 23:11:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:50,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:50,223 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:50,223 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-18 23:11:50,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:50,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467458152] [2019-12-18 23:11:50,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:50,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467458152] [2019-12-18 23:11:50,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:50,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:50,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34612227] [2019-12-18 23:11:50,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:50,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:50,277 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-18 23:11:50,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:50,904 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-18 23:11:50,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:50,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:50,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:50,964 INFO L225 Difference]: With dead ends: 27570 [2019-12-18 23:11:50,964 INFO L226 Difference]: Without dead ends: 27556 [2019-12-18 23:11:50,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-18 23:11:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-18 23:11:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-18 23:11:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-18 23:11:51,253 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-18 23:11:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:51,254 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-18 23:11:51,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-18 23:11:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:51,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:51,257 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:51,257 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:51,257 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-18 23:11:51,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:51,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588888770] [2019-12-18 23:11:51,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:51,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588888770] [2019-12-18 23:11:51,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:51,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:51,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317332571] [2019-12-18 23:11:51,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:51,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:51,334 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-18 23:11:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:52,049 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-18 23:11:52,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:52,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:52,108 INFO L225 Difference]: With dead ends: 27265 [2019-12-18 23:11:52,108 INFO L226 Difference]: Without dead ends: 27251 [2019-12-18 23:11:52,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-18 23:11:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-18 23:11:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-18 23:11:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-18 23:11:52,400 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-18 23:11:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:52,401 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-18 23:11:52,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-18 23:11:52,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:52,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:52,404 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:52,404 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-18 23:11:52,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:52,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289424758] [2019-12-18 23:11:52,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 23:11:52,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289424758] [2019-12-18 23:11:52,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:52,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:11:52,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670545203] [2019-12-18 23:11:52,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:11:52,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:52,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:11:52,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:11:52,428 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-18 23:11:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:52,553 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-18 23:11:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:11:52,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 23:11:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:52,587 INFO L225 Difference]: With dead ends: 12944 [2019-12-18 23:11:52,587 INFO L226 Difference]: Without dead ends: 12912 [2019-12-18 23:11:52,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:11:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-18 23:11:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-18 23:11:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-18 23:11:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-18 23:11:52,927 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-18 23:11:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:52,927 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-18 23:11:52,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:11:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-18 23:11:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:52,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:52,930 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:52,930 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-18 23:11:52,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:52,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057168168] [2019-12-18 23:11:52,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:52,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057168168] [2019-12-18 23:11:52,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:52,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:52,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957910296] [2019-12-18 23:11:52,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:52,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:52,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:52,983 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 9 states. [2019-12-18 23:11:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:53,653 INFO L93 Difference]: Finished difference Result 30802 states and 119509 transitions. [2019-12-18 23:11:53,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:53,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:53,735 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 23:11:53,735 INFO L226 Difference]: Without dead ends: 30786 [2019-12-18 23:11:53,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30786 states. [2019-12-18 23:11:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30786 to 9188. [2019-12-18 23:11:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-18 23:11:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-18 23:11:54,075 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-18 23:11:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:54,075 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-18 23:11:54,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-18 23:11:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:54,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:54,078 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:54,078 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:54,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:54,078 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-18 23:11:54,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:54,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82087936] [2019-12-18 23:11:54,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:54,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82087936] [2019-12-18 23:11:54,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:54,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:54,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742724980] [2019-12-18 23:11:54,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:54,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:54,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:54,122 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 9 states. [2019-12-18 23:11:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:54,741 INFO L93 Difference]: Finished difference Result 30412 states and 117823 transitions. [2019-12-18 23:11:54,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:54,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:54,807 INFO L225 Difference]: With dead ends: 30412 [2019-12-18 23:11:54,807 INFO L226 Difference]: Without dead ends: 30392 [2019-12-18 23:11:54,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30392 states. [2019-12-18 23:11:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30392 to 8937. [2019-12-18 23:11:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-18 23:11:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-18 23:11:55,133 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-18 23:11:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:55,133 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-18 23:11:55,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-18 23:11:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:55,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:55,136 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:55,136 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-18 23:11:55,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:55,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170800791] [2019-12-18 23:11:55,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:55,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170800791] [2019-12-18 23:11:55,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:55,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:55,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747597639] [2019-12-18 23:11:55,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:55,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:55,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:55,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:55,194 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 9 states. [2019-12-18 23:11:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:55,866 INFO L93 Difference]: Finished difference Result 30029 states and 116246 transitions. [2019-12-18 23:11:55,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:55,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:55,933 INFO L225 Difference]: With dead ends: 30029 [2019-12-18 23:11:55,933 INFO L226 Difference]: Without dead ends: 30013 [2019-12-18 23:11:55,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-18 23:11:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 8839. [2019-12-18 23:11:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-18 23:11:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-18 23:11:56,254 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-18 23:11:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:56,255 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-18 23:11:56,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-18 23:11:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:11:56,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:56,257 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:56,258 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-18 23:11:56,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:56,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234801772] [2019-12-18 23:11:56,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:11:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:11:56,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234801772] [2019-12-18 23:11:56,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:11:56,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:11:56,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271838376] [2019-12-18 23:11:56,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:11:56,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:11:56,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:11:56,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:11:56,313 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 9 states. [2019-12-18 23:11:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:11:57,144 INFO L93 Difference]: Finished difference Result 29761 states and 115069 transitions. [2019-12-18 23:11:57,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:11:57,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:11:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:11:57,207 INFO L225 Difference]: With dead ends: 29761 [2019-12-18 23:11:57,207 INFO L226 Difference]: Without dead ends: 29741 [2019-12-18 23:11:57,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:11:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29741 states. [2019-12-18 23:11:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29741 to 8516. [2019-12-18 23:11:57,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-18 23:11:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-18 23:11:57,520 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-18 23:11:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:11:57,521 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-18 23:11:57,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:11:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-18 23:11:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 23:11:57,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:11:57,524 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:11:57,524 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:11:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:11:57,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-18 23:11:57,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:11:57,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005502087] [2019-12-18 23:11:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:11:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:11:57,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:11:57,540 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:11:57,541 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 23:11:57,541 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-18 23:11:57,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,556 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,556 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,556 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,556 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,562 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,562 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,562 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,562 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,562 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,562 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,562 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,563 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,564 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,564 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,564 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,564 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,564 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,564 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,564 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,565 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,565 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,565 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,565 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,565 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,567 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,567 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,567 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,567 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,567 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,567 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,567 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,568 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,570 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,570 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,570 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,572 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,572 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,572 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,572 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,573 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,579 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,579 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,579 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,579 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,580 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,581 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,581 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,581 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,581 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,581 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,582 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,583 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,583 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,583 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,583 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,584 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,584 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,584 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,584 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,585 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,586 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,586 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,587 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,588 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,588 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,588 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,588 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,588 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,589 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,590 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,590 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,590 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,590 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,590 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,590 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,591 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,592 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,592 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,594 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,594 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,594 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,594 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,594 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,596 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,596 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,596 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,596 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,597 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,598 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,598 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,598 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:11:57,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-18 23:11:57,599 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:11:57,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:11:57,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:11:57,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:11:57,600 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:11:57,600 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:11:57,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:11:57,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:11:57,601 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-18 23:11:57,602 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 23:11:57,621 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 23:11:57,622 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:57,625 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 108/263 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-18 23:11:57,634 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 23:11:57,655 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 23:11:57,655 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:11:57,659 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 108/263 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-18 23:11:57,670 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-18 23:11:57,670 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:11:59,552 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 23:11:59,693 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-18 23:11:59,694 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 23:11:59,694 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-18 23:12:01,053 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-18 23:12:01,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-18 23:12:01,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:12:01,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:01,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:12:01,053 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:01,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-18 23:12:01,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:01,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189956261] [2019-12-18 23:12:01,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:01,060 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 23:12:01,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189956261] [2019-12-18 23:12:01,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:01,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:12:01,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58199080] [2019-12-18 23:12:01,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:12:01,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:01,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:12:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:12:01,062 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-18 23:12:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:01,184 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-18 23:12:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:12:01,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:12:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:01,232 INFO L225 Difference]: With dead ends: 17885 [2019-12-18 23:12:01,232 INFO L226 Difference]: Without dead ends: 16791 [2019-12-18 23:12:01,232 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 23:12:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-18 23:12:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-18 23:12:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-18 23:12:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-18 23:12:01,602 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-18 23:12:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:01,602 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-18 23:12:01,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:12:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-18 23:12:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 23:12:01,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:01,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:01,603 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-18 23:12:01,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:01,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960652116] [2019-12-18 23:12:01,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:01,618 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 23:12:01,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960652116] [2019-12-18 23:12:01,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:01,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:01,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153439342] [2019-12-18 23:12:01,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:01,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:01,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:01,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:01,620 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-18 23:12:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:02,143 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-18 23:12:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:02,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 23:12:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:02,231 INFO L225 Difference]: With dead ends: 29874 [2019-12-18 23:12:02,231 INFO L226 Difference]: Without dead ends: 29871 [2019-12-18 23:12:02,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-18 23:12:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-18 23:12:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-18 23:12:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-18 23:12:02,784 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-18 23:12:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:02,784 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-18 23:12:02,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:02,784 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-18 23:12:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:12:02,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:02,784 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:02,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:02,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-18 23:12:02,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:02,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222330038] [2019-12-18 23:12:02,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:12:02,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222330038] [2019-12-18 23:12:02,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:02,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:02,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349391414] [2019-12-18 23:12:02,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:02,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:02,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:02,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:02,804 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-18 23:12:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:03,042 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-18 23:12:03,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:03,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 23:12:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:03,158 INFO L225 Difference]: With dead ends: 34948 [2019-12-18 23:12:03,158 INFO L226 Difference]: Without dead ends: 34944 [2019-12-18 23:12:03,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-18 23:12:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-18 23:12:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-18 23:12:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-18 23:12:03,871 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-18 23:12:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:03,872 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-18 23:12:03,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-18 23:12:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:12:03,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:03,872 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:03,872 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:03,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:03,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-18 23:12:03,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:03,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530939123] [2019-12-18 23:12:03,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:12:03,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530939123] [2019-12-18 23:12:03,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995595296] [2019-12-18 23:12:03,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:03,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:03,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:12:03,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:03,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:03,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89564247] [2019-12-18 23:12:03,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:03,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:03,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:03,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:03,997 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-18 23:12:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:04,465 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-18 23:12:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:04,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:12:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:04,639 INFO L225 Difference]: With dead ends: 54752 [2019-12-18 23:12:04,639 INFO L226 Difference]: Without dead ends: 54748 [2019-12-18 23:12:04,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-18 23:12:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-18 23:12:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-18 23:12:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-18 23:12:07,604 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-18 23:12:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:07,604 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-18 23:12:07,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-18 23:12:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 23:12:07,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:07,604 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:07,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:07,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-18 23:12:07,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:07,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99222527] [2019-12-18 23:12:07,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 23:12:07,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99222527] [2019-12-18 23:12:07,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:07,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:07,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608083792] [2019-12-18 23:12:07,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:07,836 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-18 23:12:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:08,313 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-18 23:12:08,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:08,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 23:12:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:08,477 INFO L225 Difference]: With dead ends: 56062 [2019-12-18 23:12:08,477 INFO L226 Difference]: Without dead ends: 56057 [2019-12-18 23:12:08,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-18 23:12:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-18 23:12:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-18 23:12:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-18 23:12:09,374 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-18 23:12:09,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:09,374 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-18 23:12:09,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-18 23:12:09,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:12:09,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:09,375 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:09,375 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:09,376 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-18 23:12:09,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:09,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425048189] [2019-12-18 23:12:09,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:09,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425048189] [2019-12-18 23:12:09,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:09,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:09,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078634968] [2019-12-18 23:12:09,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:09,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:09,400 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-18 23:12:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:10,296 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-18 23:12:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:10,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:12:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:10,429 INFO L225 Difference]: With dead ends: 40360 [2019-12-18 23:12:10,429 INFO L226 Difference]: Without dead ends: 40352 [2019-12-18 23:12:10,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-18 23:12:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-18 23:12:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-18 23:12:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-18 23:12:11,195 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-18 23:12:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:11,195 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-18 23:12:11,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-18 23:12:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:11,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:11,196 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:11,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-18 23:12:11,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:11,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038350637] [2019-12-18 23:12:11,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:11,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038350637] [2019-12-18 23:12:11,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385718380] [2019-12-18 23:12:11,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:11,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:11,317 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:11,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:11,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900860275] [2019-12-18 23:12:11,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:11,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:11,321 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-18 23:12:11,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:11,866 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-18 23:12:11,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:11,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:12,057 INFO L225 Difference]: With dead ends: 64531 [2019-12-18 23:12:12,057 INFO L226 Difference]: Without dead ends: 64525 [2019-12-18 23:12:12,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:12,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-18 23:12:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-18 23:12:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 23:12:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-18 23:12:13,115 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-18 23:12:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:13,115 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-18 23:12:13,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-18 23:12:13,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:13,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:13,116 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:13,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:13,319 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-18 23:12:13,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:13,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543617150] [2019-12-18 23:12:13,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:13,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543617150] [2019-12-18 23:12:13,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:13,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:13,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896867798] [2019-12-18 23:12:13,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:13,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:13,358 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-18 23:12:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:15,539 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-18 23:12:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:15,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:15,741 INFO L225 Difference]: With dead ends: 66182 [2019-12-18 23:12:15,741 INFO L226 Difference]: Without dead ends: 66173 [2019-12-18 23:12:15,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-18 23:12:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-18 23:12:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-18 23:12:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-18 23:12:16,758 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-18 23:12:16,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:16,758 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-18 23:12:16,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-18 23:12:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:16,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:16,759 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:16,759 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-18 23:12:16,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:16,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396134929] [2019-12-18 23:12:16,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:16,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396134929] [2019-12-18 23:12:16,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:16,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:16,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868658329] [2019-12-18 23:12:16,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:16,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:16,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:16,799 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-18 23:12:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:17,346 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-18 23:12:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:17,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:17,546 INFO L225 Difference]: With dead ends: 66741 [2019-12-18 23:12:17,547 INFO L226 Difference]: Without dead ends: 66732 [2019-12-18 23:12:17,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-18 23:12:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-18 23:12:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-18 23:12:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-18 23:12:21,255 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-18 23:12:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:21,255 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-18 23:12:21,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-18 23:12:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:12:21,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:21,256 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:21,256 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-18 23:12:21,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:21,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123533286] [2019-12-18 23:12:21,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:21,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123533286] [2019-12-18 23:12:21,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:21,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:21,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543177815] [2019-12-18 23:12:21,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:21,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:21,288 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 7 states. [2019-12-18 23:12:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:21,824 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-18 23:12:21,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:21,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 23:12:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:22,028 INFO L225 Difference]: With dead ends: 67749 [2019-12-18 23:12:22,029 INFO L226 Difference]: Without dead ends: 67740 [2019-12-18 23:12:22,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-18 23:12:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-18 23:12:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-18 23:12:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-18 23:12:23,097 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-18 23:12:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:23,097 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-18 23:12:23,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-18 23:12:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:23,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:23,099 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:23,099 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:23,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-18 23:12:23,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:23,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759268128] [2019-12-18 23:12:23,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:23,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759268128] [2019-12-18 23:12:23,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074081885] [2019-12-18 23:12:23,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:23,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:12:23,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:23,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:23,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:12:23,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630405781] [2019-12-18 23:12:23,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:23,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:23,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:23,240 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 9 states. [2019-12-18 23:12:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:24,280 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-18 23:12:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:24,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:25,267 INFO L225 Difference]: With dead ends: 97639 [2019-12-18 23:12:25,268 INFO L226 Difference]: Without dead ends: 97635 [2019-12-18 23:12:25,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-18 23:12:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27701. [2019-12-18 23:12:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-18 23:12:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-18 23:12:26,666 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-18 23:12:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:26,666 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-18 23:12:26,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-18 23:12:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:26,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:26,667 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:26,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:26,868 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-18 23:12:26,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:26,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121854144] [2019-12-18 23:12:26,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:26,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121854144] [2019-12-18 23:12:26,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970427827] [2019-12-18 23:12:26,921 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:27,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:12:27,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:12:27,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:12:27,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 23:12:27,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:27,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:12:27,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624247009] [2019-12-18 23:12:27,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:27,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:27,017 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 9 states. [2019-12-18 23:12:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:28,138 INFO L93 Difference]: Finished difference Result 96845 states and 436549 transitions. [2019-12-18 23:12:28,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:28,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:28,413 INFO L225 Difference]: With dead ends: 96845 [2019-12-18 23:12:28,414 INFO L226 Difference]: Without dead ends: 96839 [2019-12-18 23:12:28,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96839 states. [2019-12-18 23:12:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96839 to 27343. [2019-12-18 23:12:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-18 23:12:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-18 23:12:30,384 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-18 23:12:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:30,384 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-18 23:12:30,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-18 23:12:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:30,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:30,385 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:30,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:30,586 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:30,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:30,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-18 23:12:30,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:30,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322991446] [2019-12-18 23:12:30,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:12:30,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322991446] [2019-12-18 23:12:30,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:30,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:12:30,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384126410] [2019-12-18 23:12:30,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:12:30,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:30,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:12:30,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:12:30,607 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-18 23:12:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:30,950 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-18 23:12:30,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:12:30,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 23:12:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:31,121 INFO L225 Difference]: With dead ends: 49005 [2019-12-18 23:12:31,121 INFO L226 Difference]: Without dead ends: 48989 [2019-12-18 23:12:31,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-18 23:12:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-18 23:12:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-18 23:12:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-18 23:12:32,846 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-18 23:12:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:32,846 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-18 23:12:32,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:12:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-18 23:12:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:32,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:32,848 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:32,848 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-18 23:12:32,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:32,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743031343] [2019-12-18 23:12:32,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:32,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743031343] [2019-12-18 23:12:32,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:32,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:32,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237413229] [2019-12-18 23:12:32,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:32,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:32,897 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-18 23:12:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:34,075 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-18 23:12:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:34,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:34,413 INFO L225 Difference]: With dead ends: 112418 [2019-12-18 23:12:34,413 INFO L226 Difference]: Without dead ends: 112411 [2019-12-18 23:12:34,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:34,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-18 23:12:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-18 23:12:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-18 23:12:38,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-18 23:12:38,915 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-18 23:12:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:38,915 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-18 23:12:38,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-18 23:12:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:38,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:38,916 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:38,916 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:38,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:38,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-18 23:12:38,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:38,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570039845] [2019-12-18 23:12:38,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:38,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570039845] [2019-12-18 23:12:38,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:38,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:38,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913121123] [2019-12-18 23:12:38,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:38,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:38,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:38,967 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-18 23:12:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:40,130 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-18 23:12:40,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:40,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:40,475 INFO L225 Difference]: With dead ends: 111816 [2019-12-18 23:12:40,475 INFO L226 Difference]: Without dead ends: 111807 [2019-12-18 23:12:40,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-18 23:12:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-18 23:12:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-18 23:12:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-18 23:12:42,888 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-18 23:12:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:42,888 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-18 23:12:42,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-18 23:12:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:42,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:42,889 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:42,889 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:42,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-18 23:12:42,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:42,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016040052] [2019-12-18 23:12:42,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:42,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016040052] [2019-12-18 23:12:42,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:42,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:42,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364997552] [2019-12-18 23:12:42,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:42,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:42,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:42,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:42,936 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 9 states. [2019-12-18 23:12:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:44,096 INFO L93 Difference]: Finished difference Result 112148 states and 515023 transitions. [2019-12-18 23:12:44,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:44,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:44,469 INFO L225 Difference]: With dead ends: 112148 [2019-12-18 23:12:44,469 INFO L226 Difference]: Without dead ends: 112141 [2019-12-18 23:12:44,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112141 states. [2019-12-18 23:12:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112141 to 31950. [2019-12-18 23:12:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-18 23:12:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-18 23:12:49,051 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-18 23:12:49,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:49,051 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-18 23:12:49,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:49,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-18 23:12:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 23:12:49,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:49,052 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:49,052 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:49,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:49,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-18 23:12:49,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:49,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902251188] [2019-12-18 23:12:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 23:12:49,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902251188] [2019-12-18 23:12:49,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:49,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:12:49,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265185638] [2019-12-18 23:12:49,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:12:49,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:49,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:12:49,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:12:49,108 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 9 states. [2019-12-18 23:12:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:50,166 INFO L93 Difference]: Finished difference Result 111038 states and 509212 transitions. [2019-12-18 23:12:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:12:50,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 23:12:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:50,484 INFO L225 Difference]: With dead ends: 111038 [2019-12-18 23:12:50,484 INFO L226 Difference]: Without dead ends: 111028 [2019-12-18 23:12:50,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:12:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111028 states. [2019-12-18 23:12:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111028 to 30899. [2019-12-18 23:12:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-18 23:12:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-18 23:12:52,554 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-18 23:12:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:52,554 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-18 23:12:52,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:12:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-18 23:12:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:12:52,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:52,555 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:52,556 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-18 23:12:52,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:52,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921127579] [2019-12-18 23:12:52,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:52,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921127579] [2019-12-18 23:12:52,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335655998] [2019-12-18 23:12:52,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:52,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:52,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:52,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:52,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:52,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811157862] [2019-12-18 23:12:52,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:52,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:52,678 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-18 23:12:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:53,248 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-18 23:12:53,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:53,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:12:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:54,182 INFO L225 Difference]: With dead ends: 73073 [2019-12-18 23:12:54,182 INFO L226 Difference]: Without dead ends: 73061 [2019-12-18 23:12:54,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-18 23:12:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-18 23:12:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-18 23:12:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-18 23:12:55,246 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-18 23:12:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:55,246 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-18 23:12:55,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-18 23:12:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:12:55,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:55,248 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:55,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:55,448 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:55,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-18 23:12:55,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:55,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949081895] [2019-12-18 23:12:55,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:55,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949081895] [2019-12-18 23:12:55,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290807663] [2019-12-18 23:12:55,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:55,568 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 23:12:55,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:12:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:12:55,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:12:55,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 23:12:55,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956498226] [2019-12-18 23:12:55,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:55,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:55,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:55,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:55,572 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-18 23:12:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:56,213 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-18 23:12:56,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:56,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:12:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:56,477 INFO L225 Difference]: With dead ends: 77025 [2019-12-18 23:12:56,477 INFO L226 Difference]: Without dead ends: 77011 [2019-12-18 23:12:56,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-18 23:12:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-18 23:12:58,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-18 23:12:58,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-18 23:12:58,189 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-18 23:12:58,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:12:58,189 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-18 23:12:58,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:12:58,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-18 23:12:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:12:58,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:12:58,192 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:12:58,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:12:58,392 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:12:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:12:58,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-18 23:12:58,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:12:58,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830158515] [2019-12-18 23:12:58,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:12:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:12:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:12:58,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830158515] [2019-12-18 23:12:58,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:12:58,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:12:58,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57134475] [2019-12-18 23:12:58,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:12:58,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:12:58,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:12:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:12:58,431 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-18 23:12:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:12:59,060 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-18 23:12:59,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:12:59,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:12:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:12:59,297 INFO L225 Difference]: With dead ends: 78384 [2019-12-18 23:12:59,297 INFO L226 Difference]: Without dead ends: 78365 [2019-12-18 23:12:59,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:12:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-18 23:13:00,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-18 23:13:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-18 23:13:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-18 23:13:01,028 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-18 23:13:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:01,028 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-18 23:13:01,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:13:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-18 23:13:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:13:01,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:01,030 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:01,031 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:01,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-18 23:13:01,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:01,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028541571] [2019-12-18 23:13:01,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:01,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028541571] [2019-12-18 23:13:01,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:01,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:13:01,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343076411] [2019-12-18 23:13:01,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:13:01,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:01,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:13:01,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:13:01,069 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-18 23:13:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:01,662 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-18 23:13:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:13:01,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:13:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:01,904 INFO L225 Difference]: With dead ends: 78506 [2019-12-18 23:13:01,904 INFO L226 Difference]: Without dead ends: 78487 [2019-12-18 23:13:01,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:13:02,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-18 23:13:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-18 23:13:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-18 23:13:03,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-18 23:13:03,731 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-18 23:13:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:03,732 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-18 23:13:03,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:13:03,732 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-18 23:13:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:13:03,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:03,734 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:03,734 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:03,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:03,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-18 23:13:03,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:03,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49925479] [2019-12-18 23:13:03,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:03,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49925479] [2019-12-18 23:13:03,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:03,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:13:03,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710734951] [2019-12-18 23:13:03,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:13:03,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:13:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:13:03,767 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-18 23:13:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:04,424 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-18 23:13:04,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:13:04,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:13:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:04,691 INFO L225 Difference]: With dead ends: 80886 [2019-12-18 23:13:04,691 INFO L226 Difference]: Without dead ends: 80867 [2019-12-18 23:13:04,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:13:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-18 23:13:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-18 23:13:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-18 23:13:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-18 23:13:06,610 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-18 23:13:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:06,610 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-18 23:13:06,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:13:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-18 23:13:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 23:13:06,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:06,612 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:06,612 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-18 23:13:06,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:06,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448490962] [2019-12-18 23:13:06,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:06,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448490962] [2019-12-18 23:13:06,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:06,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:13:06,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319870799] [2019-12-18 23:13:06,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 23:13:06,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:06,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 23:13:06,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:13:06,646 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 7 states. [2019-12-18 23:13:07,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:07,283 INFO L93 Difference]: Finished difference Result 81926 states and 399875 transitions. [2019-12-18 23:13:07,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:13:07,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 23:13:07,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:07,569 INFO L225 Difference]: With dead ends: 81926 [2019-12-18 23:13:07,569 INFO L226 Difference]: Without dead ends: 81907 [2019-12-18 23:13:07,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:13:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81907 states. [2019-12-18 23:13:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81907 to 35912. [2019-12-18 23:13:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-18 23:13:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-18 23:13:09,556 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-18 23:13:09,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:09,557 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-18 23:13:09,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 23:13:09,557 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-18 23:13:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:09,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:09,560 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:09,560 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-18 23:13:09,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:09,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663851537] [2019-12-18 23:13:09,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:09,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663851537] [2019-12-18 23:13:09,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470125441] [2019-12-18 23:13:09,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:09,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:09,735 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:09,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:09,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:09,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161407814] [2019-12-18 23:13:09,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:09,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:09,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:09,741 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 9 states. [2019-12-18 23:13:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:10,859 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-18 23:13:10,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:10,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:11,199 INFO L225 Difference]: With dead ends: 119601 [2019-12-18 23:13:11,199 INFO L226 Difference]: Without dead ends: 119591 [2019-12-18 23:13:11,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-18 23:13:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35598. [2019-12-18 23:13:13,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-18 23:13:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-18 23:13:13,560 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-18 23:13:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:13,560 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-18 23:13:13,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-18 23:13:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:13,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:13,563 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:13,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:13,764 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-18 23:13:13,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:13,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726243148] [2019-12-18 23:13:13,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:13,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726243148] [2019-12-18 23:13:13,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384562645] [2019-12-18 23:13:13,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:13,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:13:13,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:13,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:13,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:13,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:13,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:13,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315693793] [2019-12-18 23:13:13,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:13,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:13,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:13,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:13,901 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 9 states. [2019-12-18 23:13:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:15,154 INFO L93 Difference]: Finished difference Result 118295 states and 546185 transitions. [2019-12-18 23:13:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:15,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:15,532 INFO L225 Difference]: With dead ends: 118295 [2019-12-18 23:13:15,532 INFO L226 Difference]: Without dead ends: 118284 [2019-12-18 23:13:15,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118284 states. [2019-12-18 23:13:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118284 to 35531. [2019-12-18 23:13:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 23:13:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-18 23:13:20,137 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-18 23:13:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:20,137 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-18 23:13:20,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-18 23:13:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:20,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:20,141 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:20,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:20,342 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:20,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-18 23:13:20,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:20,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571173867] [2019-12-18 23:13:20,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:20,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571173867] [2019-12-18 23:13:20,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914439080] [2019-12-18 23:13:20,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:20,475 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:20,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:20,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:20,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:20,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624616521] [2019-12-18 23:13:20,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:20,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:20,480 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 9 states. [2019-12-18 23:13:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:22,315 INFO L93 Difference]: Finished difference Result 117353 states and 541624 transitions. [2019-12-18 23:13:22,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:22,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:22,735 INFO L225 Difference]: With dead ends: 117353 [2019-12-18 23:13:22,735 INFO L226 Difference]: Without dead ends: 117343 [2019-12-18 23:13:22,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117343 states. [2019-12-18 23:13:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117343 to 35223. [2019-12-18 23:13:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-18 23:13:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-18 23:13:24,404 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-18 23:13:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:24,404 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-18 23:13:24,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-18 23:13:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:24,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:24,406 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:24,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:24,607 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-18 23:13:24,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:24,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346419112] [2019-12-18 23:13:24,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:24,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346419112] [2019-12-18 23:13:24,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123146874] [2019-12-18 23:13:24,647 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:24,735 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:13:24,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:24,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:24,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:24,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:24,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:24,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119263112] [2019-12-18 23:13:24,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:24,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:24,741 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 9 states. [2019-12-18 23:13:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:27,302 INFO L93 Difference]: Finished difference Result 116621 states and 537886 transitions. [2019-12-18 23:13:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:27,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:27,641 INFO L225 Difference]: With dead ends: 116621 [2019-12-18 23:13:27,641 INFO L226 Difference]: Without dead ends: 116610 [2019-12-18 23:13:27,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116610 states. [2019-12-18 23:13:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116610 to 34934. [2019-12-18 23:13:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-18 23:13:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-18 23:13:29,943 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-18 23:13:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:29,944 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-18 23:13:29,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-18 23:13:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:29,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:29,947 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:30,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:30,148 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-18 23:13:30,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:30,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072185216] [2019-12-18 23:13:30,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:30,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072185216] [2019-12-18 23:13:30,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920420090] [2019-12-18 23:13:30,191 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:30,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 23:13:30,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:30,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:30,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:30,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:30,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:30,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715073554] [2019-12-18 23:13:30,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:30,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:30,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:30,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:30,285 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 9 states. [2019-12-18 23:13:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:31,530 INFO L93 Difference]: Finished difference Result 116675 states and 538001 transitions. [2019-12-18 23:13:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:31,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:31,894 INFO L225 Difference]: With dead ends: 116675 [2019-12-18 23:13:31,894 INFO L226 Difference]: Without dead ends: 116665 [2019-12-18 23:13:31,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116665 states. [2019-12-18 23:13:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116665 to 34396. [2019-12-18 23:13:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-18 23:13:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-18 23:13:36,882 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-18 23:13:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:36,882 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-18 23:13:36,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-18 23:13:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:36,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:36,884 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:37,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:37,085 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:37,086 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-18 23:13:37,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:37,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13427431] [2019-12-18 23:13:37,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:37,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13427431] [2019-12-18 23:13:37,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784545298] [2019-12-18 23:13:37,149 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:37,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 23:13:37,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:37,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:37,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:37,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:37,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:37,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795057836] [2019-12-18 23:13:37,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:37,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:37,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:37,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:37,257 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-18 23:13:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:38,393 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-18 23:13:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:38,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:38,741 INFO L225 Difference]: With dead ends: 117673 [2019-12-18 23:13:38,742 INFO L226 Difference]: Without dead ends: 117662 [2019-12-18 23:13:38,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:38,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-18 23:13:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-18 23:13:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-18 23:13:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-18 23:13:41,069 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-18 23:13:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:41,069 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-18 23:13:41,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-18 23:13:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:41,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:41,072 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:41,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:41,273 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:41,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:41,274 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-18 23:13:41,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:41,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363944800] [2019-12-18 23:13:41,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:41,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363944800] [2019-12-18 23:13:41,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608287019] [2019-12-18 23:13:41,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:41,404 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:41,405 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:41,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:41,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:41,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915033830] [2019-12-18 23:13:41,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:41,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:41,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:41,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:41,408 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-18 23:13:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:42,582 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-18 23:13:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:42,583 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:43,891 INFO L225 Difference]: With dead ends: 117232 [2019-12-18 23:13:43,891 INFO L226 Difference]: Without dead ends: 117222 [2019-12-18 23:13:43,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-18 23:13:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-18 23:13:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-18 23:13:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-18 23:13:45,483 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-18 23:13:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:45,484 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-18 23:13:45,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-18 23:13:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:45,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:45,486 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:45,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:45,687 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:45,687 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-18 23:13:45,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:45,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314297578] [2019-12-18 23:13:45,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:45,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314297578] [2019-12-18 23:13:45,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393682231] [2019-12-18 23:13:45,729 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:45,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 23:13:45,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 23:13:45,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 23:13:45,825 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 23:13:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 23:13:45,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 23:13:45,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 23:13:45,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645443010] [2019-12-18 23:13:45,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:45,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:45,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:45,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:45,829 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 9 states. [2019-12-18 23:13:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:47,571 INFO L93 Difference]: Finished difference Result 116256 states and 536656 transitions. [2019-12-18 23:13:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:47,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:47,985 INFO L225 Difference]: With dead ends: 116256 [2019-12-18 23:13:47,985 INFO L226 Difference]: Without dead ends: 116242 [2019-12-18 23:13:47,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116242 states. [2019-12-18 23:13:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116242 to 33768. [2019-12-18 23:13:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-18 23:13:49,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-18 23:13:49,568 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-18 23:13:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:49,569 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-18 23:13:49,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:49,569 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-18 23:13:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:49,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:49,572 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:49,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 23:13:49,774 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:49,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-18 23:13:49,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:49,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836083712] [2019-12-18 23:13:49,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 23:13:49,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836083712] [2019-12-18 23:13:49,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:49,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:13:49,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668661388] [2019-12-18 23:13:49,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:13:49,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:13:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:13:49,802 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-18 23:13:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:50,682 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-18 23:13:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:13:50,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 23:13:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:50,905 INFO L225 Difference]: With dead ends: 59584 [2019-12-18 23:13:50,906 INFO L226 Difference]: Without dead ends: 59552 [2019-12-18 23:13:50,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:13:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-18 23:13:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-18 23:13:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-18 23:13:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-18 23:13:52,014 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-18 23:13:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:52,014 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-18 23:13:52,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:13:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-18 23:13:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:52,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:52,017 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:52,017 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:52,017 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-18 23:13:52,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:52,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437842030] [2019-12-18 23:13:52,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:52,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437842030] [2019-12-18 23:13:52,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:52,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:13:52,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960262372] [2019-12-18 23:13:52,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:52,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:52,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:52,065 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-18 23:13:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:53,241 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-18 23:13:53,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:53,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:54,378 INFO L225 Difference]: With dead ends: 137478 [2019-12-18 23:13:54,378 INFO L226 Difference]: Without dead ends: 137462 [2019-12-18 23:13:54,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-18 23:13:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-18 23:13:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-18 23:13:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-18 23:13:56,280 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-18 23:13:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:13:56,281 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-18 23:13:56,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:13:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-18 23:13:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:13:56,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:13:56,283 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:13:56,283 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:13:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:13:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-18 23:13:56,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:13:56,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101914899] [2019-12-18 23:13:56,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:13:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:13:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:13:56,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101914899] [2019-12-18 23:13:56,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:13:56,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:13:56,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566209325] [2019-12-18 23:13:56,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:13:56,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:13:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:13:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:13:56,332 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-18 23:13:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:13:57,895 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-18 23:13:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:13:57,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:13:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:13:58,324 INFO L225 Difference]: With dead ends: 136774 [2019-12-18 23:13:58,324 INFO L226 Difference]: Without dead ends: 136758 [2019-12-18 23:13:58,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:13:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. [2019-12-18 23:14:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-18 23:14:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-18 23:14:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41129 states to 41129 states and 222593 transitions. [2019-12-18 23:14:03,820 INFO L78 Accepts]: Start accepts. Automaton has 41129 states and 222593 transitions. Word has length 25 [2019-12-18 23:14:03,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:03,820 INFO L462 AbstractCegarLoop]: Abstraction has 41129 states and 222593 transitions. [2019-12-18 23:14:03,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:03,820 INFO L276 IsEmpty]: Start isEmpty. Operand 41129 states and 222593 transitions. [2019-12-18 23:14:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:03,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:03,823 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:03,823 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash -61078994, now seen corresponding path program 6 times [2019-12-18 23:14:03,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:03,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499530368] [2019-12-18 23:14:03,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:03,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499530368] [2019-12-18 23:14:03,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:03,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:03,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029971170] [2019-12-18 23:14:03,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:03,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:03,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:03,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:03,876 INFO L87 Difference]: Start difference. First operand 41129 states and 222593 transitions. Second operand 9 states. [2019-12-18 23:14:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:05,135 INFO L93 Difference]: Finished difference Result 134734 states and 630461 transitions. [2019-12-18 23:14:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:05,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:05,597 INFO L225 Difference]: With dead ends: 134734 [2019-12-18 23:14:05,597 INFO L226 Difference]: Without dead ends: 134714 [2019-12-18 23:14:05,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134714 states. [2019-12-18 23:14:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134714 to 39950. [2019-12-18 23:14:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2019-12-18 23:14:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 216201 transitions. [2019-12-18 23:14:08,476 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 216201 transitions. Word has length 25 [2019-12-18 23:14:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:08,476 INFO L462 AbstractCegarLoop]: Abstraction has 39950 states and 216201 transitions. [2019-12-18 23:14:08,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 216201 transitions. [2019-12-18 23:14:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:08,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:08,479 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:08,479 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash -61103236, now seen corresponding path program 3 times [2019-12-18 23:14:08,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:08,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794179588] [2019-12-18 23:14:08,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:08,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794179588] [2019-12-18 23:14:08,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:08,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:08,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848120770] [2019-12-18 23:14:08,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:08,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:08,532 INFO L87 Difference]: Start difference. First operand 39950 states and 216201 transitions. Second operand 9 states. [2019-12-18 23:14:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:09,875 INFO L93 Difference]: Finished difference Result 134487 states and 629694 transitions. [2019-12-18 23:14:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:09,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:11,329 INFO L225 Difference]: With dead ends: 134487 [2019-12-18 23:14:11,329 INFO L226 Difference]: Without dead ends: 134471 [2019-12-18 23:14:11,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134471 states. [2019-12-18 23:14:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134471 to 39586. [2019-12-18 23:14:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-18 23:14:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 214214 transitions. [2019-12-18 23:14:13,366 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 214214 transitions. Word has length 25 [2019-12-18 23:14:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:13,367 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 214214 transitions. [2019-12-18 23:14:13,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 214214 transitions. [2019-12-18 23:14:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:13,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:13,371 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:13,371 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:13,371 INFO L82 PathProgramCache]: Analyzing trace with hash -69926921, now seen corresponding path program 4 times [2019-12-18 23:14:13,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:13,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866579633] [2019-12-18 23:14:13,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:13,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866579633] [2019-12-18 23:14:13,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:13,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:13,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987560862] [2019-12-18 23:14:13,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:13,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:13,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:13,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:13,428 INFO L87 Difference]: Start difference. First operand 39586 states and 214214 transitions. Second operand 9 states. [2019-12-18 23:14:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:14,973 INFO L93 Difference]: Finished difference Result 134693 states and 630836 transitions. [2019-12-18 23:14:14,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:14,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:15,374 INFO L225 Difference]: With dead ends: 134693 [2019-12-18 23:14:15,374 INFO L226 Difference]: Without dead ends: 134673 [2019-12-18 23:14:15,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134673 states. [2019-12-18 23:14:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134673 to 39511. [2019-12-18 23:14:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39511 states. [2019-12-18 23:14:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39511 states to 39511 states and 213636 transitions. [2019-12-18 23:14:20,487 INFO L78 Accepts]: Start accepts. Automaton has 39511 states and 213636 transitions. Word has length 25 [2019-12-18 23:14:20,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:20,487 INFO L462 AbstractCegarLoop]: Abstraction has 39511 states and 213636 transitions. [2019-12-18 23:14:20,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 39511 states and 213636 transitions. [2019-12-18 23:14:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:20,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:20,489 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:20,490 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash -69941956, now seen corresponding path program 4 times [2019-12-18 23:14:20,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:20,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99226868] [2019-12-18 23:14:20,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:20,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99226868] [2019-12-18 23:14:20,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:20,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:20,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735951264] [2019-12-18 23:14:20,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:20,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:20,539 INFO L87 Difference]: Start difference. First operand 39511 states and 213636 transitions. Second operand 9 states. [2019-12-18 23:14:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:21,716 INFO L93 Difference]: Finished difference Result 133500 states and 624860 transitions. [2019-12-18 23:14:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:21,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:22,112 INFO L225 Difference]: With dead ends: 133500 [2019-12-18 23:14:22,113 INFO L226 Difference]: Without dead ends: 133480 [2019-12-18 23:14:22,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133480 states. [2019-12-18 23:14:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133480 to 39284. [2019-12-18 23:14:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39284 states. [2019-12-18 23:14:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39284 states to 39284 states and 212213 transitions. [2019-12-18 23:14:24,729 INFO L78 Accepts]: Start accepts. Automaton has 39284 states and 212213 transitions. Word has length 25 [2019-12-18 23:14:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:24,729 INFO L462 AbstractCegarLoop]: Abstraction has 39284 states and 212213 transitions. [2019-12-18 23:14:24,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 39284 states and 212213 transitions. [2019-12-18 23:14:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:24,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:24,732 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:24,732 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:24,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1098510199, now seen corresponding path program 5 times [2019-12-18 23:14:24,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:24,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746513344] [2019-12-18 23:14:24,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:24,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746513344] [2019-12-18 23:14:24,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:24,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:24,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029759145] [2019-12-18 23:14:24,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:24,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:24,784 INFO L87 Difference]: Start difference. First operand 39284 states and 212213 transitions. Second operand 9 states. [2019-12-18 23:14:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:26,920 INFO L93 Difference]: Finished difference Result 134278 states and 628555 transitions. [2019-12-18 23:14:26,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:26,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:27,356 INFO L225 Difference]: With dead ends: 134278 [2019-12-18 23:14:27,356 INFO L226 Difference]: Without dead ends: 134262 [2019-12-18 23:14:27,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134262 states. [2019-12-18 23:14:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134262 to 38762. [2019-12-18 23:14:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38762 states. [2019-12-18 23:14:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38762 states to 38762 states and 209279 transitions. [2019-12-18 23:14:29,235 INFO L78 Accepts]: Start accepts. Automaton has 38762 states and 209279 transitions. Word has length 25 [2019-12-18 23:14:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:14:29,235 INFO L462 AbstractCegarLoop]: Abstraction has 38762 states and 209279 transitions. [2019-12-18 23:14:29,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:14:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 38762 states and 209279 transitions. [2019-12-18 23:14:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:14:29,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:14:29,237 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:14:29,238 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:14:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:14:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1084061564, now seen corresponding path program 5 times [2019-12-18 23:14:29,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:14:29,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300416019] [2019-12-18 23:14:29,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:14:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:14:29,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 23:14:29,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300416019] [2019-12-18 23:14:29,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:14:29,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:14:29,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204971044] [2019-12-18 23:14:29,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:14:29,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:14:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:14:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:14:29,290 INFO L87 Difference]: Start difference. First operand 38762 states and 209279 transitions. Second operand 9 states. [2019-12-18 23:14:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:14:30,813 INFO L93 Difference]: Finished difference Result 133154 states and 622565 transitions. [2019-12-18 23:14:30,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 23:14:30,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 23:14:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:14:31,225 INFO L225 Difference]: With dead ends: 133154 [2019-12-18 23:14:31,225 INFO L226 Difference]: Without dead ends: 133138 [2019-12-18 23:14:31,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 23:14:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133138 states. Received shutdown request... [2019-12-18 23:14:35,635 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 23:14:35,638 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 23:14:35,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:14:35 BasicIcfg [2019-12-18 23:14:35,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:14:35,639 INFO L168 Benchmark]: Toolchain (without parser) took 227082.80 ms. Allocated memory was 144.2 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.9 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 23:14:35,640 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 23:14:35,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.66 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 160.7 MB in the end (delta: -60.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:35,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.68 ms. Allocated memory is still 201.3 MB. Free memory was 160.7 MB in the beginning and 158.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:35,641 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 ms. Allocated memory is still 201.3 MB. Free memory was 158.6 MB in the beginning and 157.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:35,641 INFO L168 Benchmark]: RCFGBuilder took 399.50 ms. Allocated memory is still 201.3 MB. Free memory was 157.2 MB in the beginning and 137.9 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:14:35,641 INFO L168 Benchmark]: TraceAbstraction took 225832.48 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 23:14:35,642 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.43 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.66 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.4 MB in the beginning and 160.7 MB in the end (delta: -60.3 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.68 ms. Allocated memory is still 201.3 MB. Free memory was 160.7 MB in the beginning and 158.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.85 ms. Allocated memory is still 201.3 MB. Free memory was 158.6 MB in the beginning and 157.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.50 ms. Allocated memory is still 201.3 MB. Free memory was 157.2 MB in the beginning and 137.9 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225832.48 ms. Allocated memory was 201.3 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 15 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 366 VarBasedMoverChecksPositive, 5 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 615 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 97 ProgramPointsBefore, 34 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1107 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 139 ProgramPointsBefore, 50 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 160 ProgramPointsBefore, 58 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1765 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4276 CheckedPairsTotal, 117 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 158.0s, OverallIterations: 40, TraceHistogramMax: 5, AutomataDifference: 57.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3140 SDtfs, 9698 SDslu, 9533 SDs, 0 SdLazy, 10861 SolverSat, 772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1150 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5303 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42643occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.8s AutomataMinimizationTime, 40 MinimizatonAttempts, 2341583 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1126 ConstructedInterpolants, 0 QuantifiedInterpolants, 73644 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 54 InterpolantComputations, 26 PerfectInterpolantSequences, 552/746 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